./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-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:04:08,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:04:08,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:04:08,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:04:08,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:04:08,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:04:08,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:04:08,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:04:08,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:04:08,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:04:08,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:04:08,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:04:08,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:04:08,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:04:08,917 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:04:08,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:04:08,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:04:08,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:04:08,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:04:08,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:04:08,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:04:08,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:04:08,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:04:08,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:04:08,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:04:08,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:04:08,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:04:08,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:04:08,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:04:08,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:04:08,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:04:08,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:04:08,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:04:08,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:04:08,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:04:08,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:04:08,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:04:08,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:04:08,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:04:08,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:04:08,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:04:08,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:04:08,928 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-clean/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-clean/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 -> 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 [2024-10-11 14:04:09,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:04:09,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:04:09,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:04:09,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:04:09,189 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:04:09,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i [2024-10-11 14:04:10,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:04:10,673 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:04:10,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i [2024-10-11 14:04:10,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/50eaa016c/9598164df6504d0e9161f437f37719af/FLAG4972c28b0 [2024-10-11 14:04:11,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/50eaa016c/9598164df6504d0e9161f437f37719af [2024-10-11 14:04:11,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:04:11,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:04:11,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:04:11,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:04:11,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:04:11,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e76d607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11, skipping insertion in model container [2024-10-11 14:04:11,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:04:11,248 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-82.i[917,930] [2024-10-11 14:04:11,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:04:11,347 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:04:11,357 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-82.i[917,930] [2024-10-11 14:04:11,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:04:11,404 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:04:11,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11 WrapperNode [2024-10-11 14:04:11,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:04:11,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:04:11,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:04:11,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:04:11,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,466 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-10-11 14:04:11,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:04:11,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:04:11,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:04:11,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:04:11,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,517 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2024-10-11 14:04:11,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:04:11,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:04:11,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:04:11,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:04:11,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (1/1) ... [2024-10-11 14:04:11,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:04:11,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:04:11,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:04:11,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:04:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:04:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:04:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:04:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:04:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:04:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:04:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:04:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:04:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:04:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:04:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:04:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:04:11,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:04:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:04:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:04:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:04:11,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:04:11,736 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:04:11,737 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:04:12,183 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-11 14:04:12,183 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:04:12,217 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:04:12,218 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:04:12,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:12 BoogieIcfgContainer [2024-10-11 14:04:12,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:04:12,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:04:12,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:04:12,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:04:12,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:04:11" (1/3) ... [2024-10-11 14:04:12,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35267968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:12, skipping insertion in model container [2024-10-11 14:04:12,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:11" (2/3) ... [2024-10-11 14:04:12,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35267968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:12, skipping insertion in model container [2024-10-11 14:04:12,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:12" (3/3) ... [2024-10-11 14:04:12,228 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-82.i [2024-10-11 14:04:12,243 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:04:12,243 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:04:12,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:04:12,331 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;@317bc71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:04:12,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:04:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:04:12,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:12,376 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:12,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:12,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1349110231, now seen corresponding path program 1 times [2024-10-11 14:04:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474993181] [2024-10-11 14:04:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:12,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:12,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474993181] [2024-10-11 14:04:12,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474993181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:12,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:12,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:04:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911976074] [2024-10-11 14:04:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:12,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:04:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:12,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:04:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:04:12,853 INFO L87 Difference]: Start difference. First operand has 108 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:12,899 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2024-10-11 14:04:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:04:12,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-10-11 14:04:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:12,908 INFO L225 Difference]: With dead ends: 213 [2024-10-11 14:04:12,908 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 14:04:12,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-11 14:04:12,915 INFO L432 NwaCegarLoop]: 148 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, 148 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-11 14:04:12,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 14:04:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 14:04:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-10-11 14:04:12,970 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 116 [2024-10-11 14:04:12,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:12,971 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-10-11 14:04:12,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-10-11 14:04:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:04:12,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:12,978 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:12,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:04:12,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:12,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -950139007, now seen corresponding path program 1 times [2024-10-11 14:04:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:12,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35749225] [2024-10-11 14:04:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:13,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:13,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35749225] [2024-10-11 14:04:13,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35749225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:13,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:13,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:13,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472402303] [2024-10-11 14:04:13,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:13,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:13,349 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:13,398 INFO L93 Difference]: Finished difference Result 213 states and 306 transitions. [2024-10-11 14:04:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-10-11 14:04:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:13,402 INFO L225 Difference]: With dead ends: 213 [2024-10-11 14:04:13,404 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 14:04:13,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11 14:04:13,406 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 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-11 14:04:13,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 14:04:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 14:04:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-10-11 14:04:13,423 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 116 [2024-10-11 14:04:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:13,424 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-10-11 14:04:13,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-10-11 14:04:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:04:13,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:13,426 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:13,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:04:13,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:13,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash 916569667, now seen corresponding path program 1 times [2024-10-11 14:04:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047831328] [2024-10-11 14:04:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:13,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047831328] [2024-10-11 14:04:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047831328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:13,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:13,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:13,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232754298] [2024-10-11 14:04:13,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:13,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:13,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:13,779 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:13,814 INFO L93 Difference]: Finished difference Result 217 states and 310 transitions. [2024-10-11 14:04:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:13,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-10-11 14:04:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:13,816 INFO L225 Difference]: With dead ends: 217 [2024-10-11 14:04:13,816 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 14:04:13,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-11 14:04:13,817 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 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-11 14:04:13,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 14:04:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 14:04:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-10-11 14:04:13,828 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 116 [2024-10-11 14:04:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:13,829 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-10-11 14:04:13,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-10-11 14:04:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:04:13,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:13,830 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:13,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:04:13,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1317425711, now seen corresponding path program 1 times [2024-10-11 14:04:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:13,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173852111] [2024-10-11 14:04:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:14,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173852111] [2024-10-11 14:04:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173852111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:14,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:04:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781276547] [2024-10-11 14:04:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:14,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:14,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:14,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:14,066 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:14,110 INFO L93 Difference]: Finished difference Result 222 states and 315 transitions. [2024-10-11 14:04:14,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:14,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:04:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:14,112 INFO L225 Difference]: With dead ends: 222 [2024-10-11 14:04:14,112 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 14:04:14,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:14,113 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:14,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 571 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 14:04:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2024-10-11 14:04:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-10-11 14:04:14,121 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 118 [2024-10-11 14:04:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:14,122 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-10-11 14:04:14,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-10-11 14:04:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 14:04:14,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:14,123 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:14,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:04:14,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:14,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1492336204, now seen corresponding path program 1 times [2024-10-11 14:04:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347617372] [2024-10-11 14:04:14,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:14,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:14,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347617372] [2024-10-11 14:04:14,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347617372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:14,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:14,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:14,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702212616] [2024-10-11 14:04:14,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:14,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:14,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:14,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:14,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:14,273 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:14,318 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2024-10-11 14:04:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-11 14:04:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:14,323 INFO L225 Difference]: With dead ends: 224 [2024-10-11 14:04:14,323 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 14:04:14,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11 14:04:14,325 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:14,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 14:04:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 14:04:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-10-11 14:04:14,339 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 120 [2024-10-11 14:04:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:14,340 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-10-11 14:04:14,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-10-11 14:04:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 14:04:14,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:14,342 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:14,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:04:14,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:14,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash 682989578, now seen corresponding path program 1 times [2024-10-11 14:04:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:14,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752387842] [2024-10-11 14:04:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752387842] [2024-10-11 14:04:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752387842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383660330] [2024-10-11 14:04:14,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:14,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:14,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:14,511 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:14,544 INFO L93 Difference]: Finished difference Result 228 states and 321 transitions. [2024-10-11 14:04:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-11 14:04:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:14,546 INFO L225 Difference]: With dead ends: 228 [2024-10-11 14:04:14,546 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 14:04:14,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11 14:04:14,547 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:14,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 429 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 14:04:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 14:04:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-10-11 14:04:14,559 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 120 [2024-10-11 14:04:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:14,562 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-10-11 14:04:14,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-10-11 14:04:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 14:04:14,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:14,564 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:14,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:04:14,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:14,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash 740247880, now seen corresponding path program 1 times [2024-10-11 14:04:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:14,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336812466] [2024-10-11 14:04:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:14,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:14,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336812466] [2024-10-11 14:04:14,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336812466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:14,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:14,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870815094] [2024-10-11 14:04:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:14,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:14,703 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:14,734 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2024-10-11 14:04:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-11 14:04:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:14,736 INFO L225 Difference]: With dead ends: 232 [2024-10-11 14:04:14,736 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 14:04:14,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11 14:04:14,737 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:14,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 14:04:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-11 14:04:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2024-10-11 14:04:14,742 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 120 [2024-10-11 14:04:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:14,743 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2024-10-11 14:04:14,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2024-10-11 14:04:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 14:04:14,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:14,744 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:14,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:04:14,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:14,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash 740307462, now seen corresponding path program 1 times [2024-10-11 14:04:14,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:14,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627424586] [2024-10-11 14:04:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:14,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:15,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627424586] [2024-10-11 14:04:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627424586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:15,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:15,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210864082] [2024-10-11 14:04:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:15,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:15,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:15,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:15,026 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:15,098 INFO L93 Difference]: Finished difference Result 228 states and 318 transitions. [2024-10-11 14:04:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:15,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-11 14:04:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:15,100 INFO L225 Difference]: With dead ends: 228 [2024-10-11 14:04:15,100 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 14:04:15,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11 14:04:15,101 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:15,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:04:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 14:04:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 14:04:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2024-10-11 14:04:15,110 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 120 [2024-10-11 14:04:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:15,111 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2024-10-11 14:04:15,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-10-11 14:04:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 14:04:15,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:15,112 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:15,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:04:15,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:15,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:15,112 INFO L85 PathProgramCache]: Analyzing trace with hash 500228837, now seen corresponding path program 1 times [2024-10-11 14:04:15,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:15,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488892430] [2024-10-11 14:04:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:20,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488892430] [2024-10-11 14:04:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488892430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:20,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 14:04:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798698553] [2024-10-11 14:04:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:20,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 14:04:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:20,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 14:04:20,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:04:20,425 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-11 14:04:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:22,759 INFO L93 Difference]: Finished difference Result 329 states and 450 transitions. [2024-10-11 14:04:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 14:04:22,762 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 121 [2024-10-11 14:04:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:22,763 INFO L225 Difference]: With dead ends: 329 [2024-10-11 14:04:22,763 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 14:04:22,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2024-10-11 14:04:22,764 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 524 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:22,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 942 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 14:04:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 14:04:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 132. [2024-10-11 14:04:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2024-10-11 14:04:22,778 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 121 [2024-10-11 14:04:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:22,779 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2024-10-11 14:04:22,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-11 14:04:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2024-10-11 14:04:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 14:04:22,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:22,781 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:22,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:04:22,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:22,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1582115460, now seen corresponding path program 1 times [2024-10-11 14:04:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200762957] [2024-10-11 14:04:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:22,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200762957] [2024-10-11 14:04:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200762957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:22,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:22,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:04:22,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17898944] [2024-10-11 14:04:22,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:04:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:22,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:04:22,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:22,925 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:23,022 INFO L93 Difference]: Finished difference Result 345 states and 475 transitions. [2024-10-11 14:04:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:04:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-11 14:04:23,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:23,024 INFO L225 Difference]: With dead ends: 345 [2024-10-11 14:04:23,024 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 14:04:23,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:04:23,025 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 67 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:23,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 702 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:04:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 14:04:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 176. [2024-10-11 14:04:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 160 states have (on average 1.35625) internal successors, (217), 160 states have internal predecessors, (217), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 245 transitions. [2024-10-11 14:04:23,042 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 245 transitions. Word has length 121 [2024-10-11 14:04:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:23,042 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 245 transitions. [2024-10-11 14:04:23,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 245 transitions. [2024-10-11 14:04:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 14:04:23,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:23,045 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:04:23,045 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:23,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1671473916, now seen corresponding path program 1 times [2024-10-11 14:04:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715145656] [2024-10-11 14:04:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:23,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715145656] [2024-10-11 14:04:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715145656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:23,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:04:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964153907] [2024-10-11 14:04:23,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:23,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:04:23,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:23,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:04:23,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:23,173 INFO L87 Difference]: Start difference. First operand 176 states and 245 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:23,267 INFO L93 Difference]: Finished difference Result 426 states and 593 transitions. [2024-10-11 14:04:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:04:23,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-11 14:04:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:23,269 INFO L225 Difference]: With dead ends: 426 [2024-10-11 14:04:23,269 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 14:04:23,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:04:23,270 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 63 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:23,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 856 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:04:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 14:04:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 213. [2024-10-11 14:04:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 197 states have (on average 1.365482233502538) internal successors, (269), 197 states have internal predecessors, (269), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 297 transitions. [2024-10-11 14:04:23,284 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 297 transitions. Word has length 121 [2024-10-11 14:04:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 297 transitions. [2024-10-11 14:04:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 297 transitions. [2024-10-11 14:04:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 14:04:23,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:23,287 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:04:23,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash -410870381, now seen corresponding path program 1 times [2024-10-11 14:04:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799972002] [2024-10-11 14:04:23,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:04:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:23,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799972002] [2024-10-11 14:04:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799972002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:23,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:23,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:04:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910462043] [2024-10-11 14:04:23,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:23,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:04:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:23,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:04:23,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:23,480 INFO L87 Difference]: Start difference. First operand 213 states and 297 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:23,723 INFO L93 Difference]: Finished difference Result 552 states and 767 transitions. [2024-10-11 14:04:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:04:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-11 14:04:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:23,725 INFO L225 Difference]: With dead ends: 552 [2024-10-11 14:04:23,725 INFO L226 Difference]: Without dead ends: 340 [2024-10-11 14:04:23,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:04:23,726 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 119 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:23,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 490 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:04:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-11 14:04:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 296. [2024-10-11 14:04:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 265 states have (on average 1.3471698113207546) internal successors, (357), 265 states have internal predecessors, (357), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 14:04:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 413 transitions. [2024-10-11 14:04:23,755 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 413 transitions. Word has length 121 [2024-10-11 14:04:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:23,756 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 413 transitions. [2024-10-11 14:04:23,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 413 transitions. [2024-10-11 14:04:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 14:04:23,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:23,757 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:23,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:04:23,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2099235794, now seen corresponding path program 1 times [2024-10-11 14:04:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46766423] [2024-10-11 14:04:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:04:23,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:04:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:04:24,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:04:24,071 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:04:24,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:04:24,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:04:24,076 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:24,198 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:04:24,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:04:24 BoogieIcfgContainer [2024-10-11 14:04:24,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:04:24,202 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:04:24,202 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:04:24,202 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:04:24,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:12" (3/4) ... [2024-10-11 14:04:24,204 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 14:04:24,205 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:04:24,206 INFO L158 Benchmark]: Toolchain (without parser) took 13135.70ms. Allocated memory was 184.5MB in the beginning and 453.0MB in the end (delta: 268.4MB). Free memory was 129.2MB in the beginning and 205.2MB in the end (delta: -76.0MB). Peak memory consumption was 193.9MB. Max. memory is 16.1GB. [2024-10-11 14:04:24,206 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:04:24,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.01ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 111.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 14:04:24,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.34ms. Allocated memory is still 184.5MB. Free memory was 111.9MB in the beginning and 107.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:04:24,206 INFO L158 Benchmark]: Boogie Preprocessor took 83.07ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 101.5MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 14:04:24,206 INFO L158 Benchmark]: RCFGBuilder took 667.74ms. Allocated memory is still 184.5MB. Free memory was 101.5MB in the beginning and 59.2MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 14:04:24,207 INFO L158 Benchmark]: TraceAbstraction took 11980.65ms. Allocated memory was 184.5MB in the beginning and 453.0MB in the end (delta: 268.4MB). Free memory was 58.3MB in the beginning and 206.3MB in the end (delta: -147.9MB). Peak memory consumption was 122.6MB. Max. memory is 16.1GB. [2024-10-11 14:04:24,207 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 453.0MB. Free memory was 206.3MB in the beginning and 205.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:04:24,208 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 184.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.01ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 111.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.34ms. Allocated memory is still 184.5MB. Free memory was 111.9MB in the beginning and 107.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.07ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 101.5MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 667.74ms. Allocated memory is still 184.5MB. Free memory was 101.5MB in the beginning and 59.2MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11980.65ms. Allocated memory was 184.5MB in the beginning and 453.0MB in the end (delta: 268.4MB). Free memory was 58.3MB in the beginning and 206.3MB in the end (delta: -147.9MB). Peak memory consumption was 122.6MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 453.0MB. Free memory was 206.3MB in the beginning and 205.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L55] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L58] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L61] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L63] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L65] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L66] double* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L68] double* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L69] unsigned char last_1_WrapperStruct00_var_1_5 = 32; [L70] unsigned char last_1_WrapperStruct00_var_1_12 = 2; [L71] unsigned char last_1_WrapperStruct00_var_1_17 = 0; [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L127] EXPR WrapperStruct00.var_1_5 [L127] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L128] EXPR WrapperStruct00.var_1_12 [L128] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L129] EXPR WrapperStruct00.var_1_17 [L129] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L139] RET updateLastVariables() [L140] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L108] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L116] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L119] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L122] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L140] RET updateVariables() [L141] CALL step() [L75] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L75] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12; [L76] COND FALSE !((last_1_WrapperStruct00_var_1_5 / -2) >= stepLocal_0) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L79] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L79] (*(WrapperStruct00_var_1_5_Pointer)) = ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L81] COND FALSE !(! (*(WrapperStruct00_var_1_2_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L86] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L87] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L87] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L88] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_3_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L89] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_9_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L90] COND FALSE !(((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= stepLocal_1) [L99] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L99] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L141] RET step() [L142] CALL, EXPR property() [L132] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 [L132] EXPR (! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L132] EXPR ((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR (((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L132] EXPR ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132-L133] return ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 776 mSDsluCounter, 6236 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4539 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1676 IncrementalHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 1697 mSDtfsCounter, 1676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=12, InterpolantAutomatonStates: 64, 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, 12 MinimizatonAttempts, 210 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1553 NumberOfCodeBlocks, 1553 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1418 ConstructedInterpolants, 0 QuantifiedInterpolants, 6999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 4368/4368 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-11 14:04:24,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:04:26,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:04:26,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 14:04:26,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:04:26,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:04:26,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:04:26,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:04:26,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:04:26,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:04:26,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:04:26,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:04:26,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:04:26,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:04:26,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:04:26,310 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:04:26,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:04:26,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:04:26,313 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:04:26,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:04:26,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:04:26,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:04:26,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:04:26,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:04:26,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 14:04:26,316 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 14:04:26,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:04:26,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 14:04:26,317 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:04:26,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:04:26,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:04:26,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:04:26,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:04:26,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:04:26,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:04:26,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:04:26,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:04:26,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:04:26,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:04:26,319 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 14:04:26,320 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 14:04:26,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:04:26,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:04:26,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:04:26,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:04:26,322 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 14:04:26,322 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-clean/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-clean/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 -> 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 [2024-10-11 14:04:26,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:04:26,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:04:26,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:04:26,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:04:26,609 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:04:26,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i [2024-10-11 14:04:28,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:04:28,226 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:04:28,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i [2024-10-11 14:04:28,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b535d78d2/255960d8ba4d4ed8a39218277a948c94/FLAG80aeef873 [2024-10-11 14:04:28,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b535d78d2/255960d8ba4d4ed8a39218277a948c94 [2024-10-11 14:04:28,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:04:28,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:04:28,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:04:28,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:04:28,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:04:28,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634db50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28, skipping insertion in model container [2024-10-11 14:04:28,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:04:28,436 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-82.i[917,930] [2024-10-11 14:04:28,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:04:28,529 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:04:28,540 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-82.i[917,930] [2024-10-11 14:04:28,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:04:28,601 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:04:28,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28 WrapperNode [2024-10-11 14:04:28,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:04:28,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:04:28,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:04:28,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:04:28,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,686 INFO L138 Inliner]: procedures = 33, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2024-10-11 14:04:28,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:04:28,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:04:28,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:04:28,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:04:28,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,744 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2024-10-11 14:04:28,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:04:28,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:04:28,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:04:28,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:04:28,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (1/1) ... [2024-10-11 14:04:28,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:04:28,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:04:28,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:04:28,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:04:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:04:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 14:04:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 14:04:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 14:04:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 14:04:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 14:04:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 14:04:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 14:04:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 14:04:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:04:28,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:04:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:04:28,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:04:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 14:04:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 14:04:29,000 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:04:29,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:04:31,843 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-11 14:04:31,843 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:04:31,884 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:04:31,885 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:04:31,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:31 BoogieIcfgContainer [2024-10-11 14:04:31,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:04:31,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:04:31,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:04:31,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:04:31,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:04:28" (1/3) ... [2024-10-11 14:04:31,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb79f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:31, skipping insertion in model container [2024-10-11 14:04:31,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:28" (2/3) ... [2024-10-11 14:04:31,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb79f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:31, skipping insertion in model container [2024-10-11 14:04:31,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:31" (3/3) ... [2024-10-11 14:04:31,893 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-82.i [2024-10-11 14:04:31,908 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:04:31,909 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:04:31,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:04:31,977 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;@7ed2ebf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:04:31,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:04:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:04:31,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:31,998 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:31,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:32,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1544134571, now seen corresponding path program 1 times [2024-10-11 14:04:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641265604] [2024-10-11 14:04:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:32,018 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-11 14:04:32,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:32,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 14:04:32,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:32,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 14:04:32,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-11 14:04:32,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:32,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641265604] [2024-10-11 14:04:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641265604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:32,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:32,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:04:32,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110255609] [2024-10-11 14:04:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:04:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:32,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:04:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:04:32,399 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:32,444 INFO L93 Difference]: Finished difference Result 199 states and 312 transitions. [2024-10-11 14:04:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:04:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-11 14:04:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:32,455 INFO L225 Difference]: With dead ends: 199 [2024-10-11 14:04:32,455 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 14:04:32,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-11 14:04:32,461 INFO L432 NwaCegarLoop]: 137 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, 137 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-11 14:04:32,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 14:04:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 14:04:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-10-11 14:04:32,504 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 114 [2024-10-11 14:04:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:32,505 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-10-11 14:04:32,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-10-11 14:04:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:04:32,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:32,510 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:32,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 14:04:32,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 14:04:32,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:32,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash 19867647, now seen corresponding path program 1 times [2024-10-11 14:04:32,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:32,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112686851] [2024-10-11 14:04:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:32,717 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-11 14:04:32,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:32,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 14:04:32,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:32,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:04:32,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-11 14:04:33,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:33,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:33,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112686851] [2024-10-11 14:04:33,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112686851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930469039] [2024-10-11 14:04:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:33,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:33,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:33,045 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:33,157 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2024-10-11 14:04:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:33,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-11 14:04:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:33,159 INFO L225 Difference]: With dead ends: 199 [2024-10-11 14:04:33,159 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:04:33,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-11 14:04:33,162 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 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-11 14:04:33,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:04:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:04:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 14:04:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-10-11 14:04:33,172 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 114 [2024-10-11 14:04:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:33,173 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-10-11 14:04:33,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:04:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-10-11 14:04:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:04:33,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:33,176 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:33,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 14:04:33,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 14:04:33,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1877629119, now seen corresponding path program 1 times [2024-10-11 14:04:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298871559] [2024-10-11 14:04:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:33,379 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-11 14:04:33,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:33,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 14:04:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 14:04:33,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:33,675 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 21 treesize of output 9 [2024-10-11 14:04:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:34,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:34,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:34,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298871559] [2024-10-11 14:04:34,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298871559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:34,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:34,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138464232] [2024-10-11 14:04:34,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:34,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:34,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:34,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:34,087 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:37,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:04:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:37,578 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2024-10-11 14:04:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:37,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-11 14:04:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:37,580 INFO L225 Difference]: With dead ends: 298 [2024-10-11 14:04:37,581 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 14:04:37,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:04:37,583 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 110 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:37,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 397 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 14:04:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 14:04:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 171. [2024-10-11 14:04:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 140 states have internal predecessors, (188), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 14:04:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 244 transitions. [2024-10-11 14:04:37,603 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 244 transitions. Word has length 114 [2024-10-11 14:04:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:37,604 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 244 transitions. [2024-10-11 14:04:37,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 244 transitions. [2024-10-11 14:04:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:04:37,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:37,605 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:37,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 14:04:37,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 14:04:37,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:37,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash -522559048, now seen corresponding path program 1 times [2024-10-11 14:04:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:37,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84993140] [2024-10-11 14:04:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:37,811 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-11 14:04:37,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:37,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 14:04:37,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:04:38,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:38,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:38,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84993140] [2024-10-11 14:04:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84993140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765667670] [2024-10-11 14:04:38,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:38,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:38,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:38,069 INFO L87 Difference]: Start difference. First operand 171 states and 244 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:38,133 INFO L93 Difference]: Finished difference Result 275 states and 392 transitions. [2024-10-11 14:04:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:38,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-11 14:04:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:38,135 INFO L225 Difference]: With dead ends: 275 [2024-10-11 14:04:38,135 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 14:04:38,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-11 14:04:38,136 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 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-11 14:04:38,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 14:04:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-10-11 14:04:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 144 states have internal predecessors, (192), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 14:04:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2024-10-11 14:04:38,154 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 114 [2024-10-11 14:04:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:38,154 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2024-10-11 14:04:38,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2024-10-11 14:04:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:04:38,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:38,156 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:38,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 14:04:38,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 14:04:38,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:38,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1956709990, now seen corresponding path program 1 times [2024-10-11 14:04:38,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306255576] [2024-10-11 14:04:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:38,358 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-11 14:04:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:38,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 14:04:38,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 14:04:38,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:38,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:38,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:38,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306255576] [2024-10-11 14:04:38,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306255576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:38,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:38,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:04:38,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380036725] [2024-10-11 14:04:38,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:38,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:38,621 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:38,709 INFO L93 Difference]: Finished difference Result 283 states and 400 transitions. [2024-10-11 14:04:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-10-11 14:04:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:38,711 INFO L225 Difference]: With dead ends: 283 [2024-10-11 14:04:38,712 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 14:04:38,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:38,713 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:38,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:04:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 14:04:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-10-11 14:04:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 146 states have internal predecessors, (194), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 14:04:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2024-10-11 14:04:38,729 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 116 [2024-10-11 14:04:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:38,729 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2024-10-11 14:04:38,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2024-10-11 14:04:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:04:38,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:38,731 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:38,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 14:04:38,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 14:04:38,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:38,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2002010047, now seen corresponding path program 1 times [2024-10-11 14:04:38,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:38,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131389392] [2024-10-11 14:04:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:38,933 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-11 14:04:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:38,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 14:04:38,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:39,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 14:04:39,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:39,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:39,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131389392] [2024-10-11 14:04:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131389392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:39,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862268691] [2024-10-11 14:04:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:39,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:39,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:39,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:39,170 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:40,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:04:42,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:04:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:43,020 INFO L93 Difference]: Finished difference Result 276 states and 389 transitions. [2024-10-11 14:04:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:43,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:04:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:43,021 INFO L225 Difference]: With dead ends: 276 [2024-10-11 14:04:43,022 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 14:04:43,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 115 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-11 14:04:43,022 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:43,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 14:04:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 14:04:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-11 14:04:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 136 states have internal predecessors, (178), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 14:04:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2024-10-11 14:04:43,035 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 234 transitions. Word has length 118 [2024-10-11 14:04:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:43,035 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 234 transitions. [2024-10-11 14:04:43,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 234 transitions. [2024-10-11 14:04:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:04:43,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:43,038 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:43,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:43,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 14:04:43,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:43,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1641062616, now seen corresponding path program 1 times [2024-10-11 14:04:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773289183] [2024-10-11 14:04:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:43,240 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-11 14:04:43,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:43,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 14:04:43,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:43,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:04:43,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:43,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:43,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773289183] [2024-10-11 14:04:43,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773289183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:43,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:43,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:43,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226417472] [2024-10-11 14:04:43,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:43,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:43,486 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:43,624 INFO L93 Difference]: Finished difference Result 268 states and 375 transitions. [2024-10-11 14:04:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:04:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:43,627 INFO L225 Difference]: With dead ends: 268 [2024-10-11 14:04:43,627 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 14:04:43,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 115 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-11 14:04:43,628 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:43,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:04:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 14:04:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2024-10-11 14:04:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 14:04:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 236 transitions. [2024-10-11 14:04:43,638 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 236 transitions. Word has length 118 [2024-10-11 14:04:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:43,638 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 236 transitions. [2024-10-11 14:04:43,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 236 transitions. [2024-10-11 14:04:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:04:43,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:43,639 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:43,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:43,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-11 14:04:43,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:43,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1844558054, now seen corresponding path program 1 times [2024-10-11 14:04:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652196578] [2024-10-11 14:04:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:43,845 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-11 14:04:43,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:43,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 14:04:43,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 14:04:44,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:44,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:44,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:44,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652196578] [2024-10-11 14:04:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652196578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:44,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:04:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670404601] [2024-10-11 14:04:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:44,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:44,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:44,071 INFO L87 Difference]: Start difference. First operand 169 states and 236 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:44,203 INFO L93 Difference]: Finished difference Result 272 states and 379 transitions. [2024-10-11 14:04:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:04:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:44,205 INFO L225 Difference]: With dead ends: 272 [2024-10-11 14:04:44,205 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 14:04:44,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:44,206 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:44,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 499 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:04:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 14:04:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2024-10-11 14:04:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 140 states have (on average 1.3) internal successors, (182), 140 states have internal predecessors, (182), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 14:04:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 238 transitions. [2024-10-11 14:04:44,218 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 238 transitions. Word has length 118 [2024-10-11 14:04:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:44,218 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 238 transitions. [2024-10-11 14:04:44,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 238 transitions. [2024-10-11 14:04:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:04:44,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:44,219 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:44,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 14:04:44,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-11 14:04:44,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:44,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1901816356, now seen corresponding path program 1 times [2024-10-11 14:04:44,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:44,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591772703] [2024-10-11 14:04:44,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:44,421 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-11 14:04:44,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:44,422 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 14:04:44,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:04:44,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 14:04:44,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:44,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:44,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591772703] [2024-10-11 14:04:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591772703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:04:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299609147] [2024-10-11 14:04:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:44,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:04:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:04:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:44,678 INFO L87 Difference]: Start difference. First operand 171 states and 238 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:44,871 INFO L93 Difference]: Finished difference Result 276 states and 383 transitions. [2024-10-11 14:04:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:04:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-11 14:04:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:44,874 INFO L225 Difference]: With dead ends: 276 [2024-10-11 14:04:44,874 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 14:04:44,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:44,875 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:44,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 619 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:04:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 14:04:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2024-10-11 14:04:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 142 states have (on average 1.295774647887324) internal successors, (184), 142 states have internal predecessors, (184), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 14:04:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 240 transitions. [2024-10-11 14:04:44,884 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 240 transitions. Word has length 118 [2024-10-11 14:04:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:44,884 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 240 transitions. [2024-10-11 14:04:44,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:04:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 240 transitions. [2024-10-11 14:04:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 14:04:44,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:44,886 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:44,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 14:04:45,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-11 14:04:45,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:45,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1901875938, now seen corresponding path program 1 times [2024-10-11 14:04:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704979790] [2024-10-11 14:04:45,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:45,088 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-11 14:04:45,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:45,089 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-11 14:04:45,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Waiting until timeout for monitored process [2024-10-11 14:04:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 14:04:45,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:49,780 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-11 14:04:50,845 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-11 14:04:51,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-11 14:04:53,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 14:04:54,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2024-10-11 14:04:54,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 82 [2024-10-11 14:04:55,427 INFO L349 Elim1Store]: treesize reduction 368, result has 5.4 percent of original size [2024-10-11 14:04:55,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 36 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 215 treesize of output 364 [2024-10-11 14:04:57,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 83 [2024-10-11 14:04:57,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 72 [2024-10-11 14:04:57,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 72 [2024-10-11 14:04:57,641 INFO L349 Elim1Store]: treesize reduction 107, result has 13.0 percent of original size [2024-10-11 14:04:57,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 30 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 120 treesize of output 96 [2024-10-11 14:04:57,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 72 [2024-10-11 14:04:58,457 INFO L349 Elim1Store]: treesize reduction 79, result has 12.2 percent of original size [2024-10-11 14:04:58,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 478 treesize of output 329 [2024-10-11 14:05:06,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:05:06,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 660 treesize of output 504