./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:10:24,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:10:24,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:10:24,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:10:24,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:10:24,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:10:24,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:10:24,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:10:24,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:10:24,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:10:24,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:10:24,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:10:24,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:10:24,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:10:24,905 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:10:24,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:10:24,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:10:24,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:10:24,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:10:24,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:10:24,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:10:24,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:10:24,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:10:24,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:10:24,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:10:24,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:10:24,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:10:24,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:10:24,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:10:24,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:10:24,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:10:24,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:10:24,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:10:24,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:10:24,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:10:24,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:10:24,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:10:24,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:10:24,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:10:24,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:10:24,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:10:24,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:10:24,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b [2024-11-09 02:10:25,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:10:25,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:10:25,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:10:25,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:10:25,209 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:10:25,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-09 02:10:26,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:10:26,944 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:10:26,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-09 02:10:26,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12eb6eb7d/1fd4e038544d4a6b80583d21febc8410/FLAGac6f71582 [2024-11-09 02:10:26,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12eb6eb7d/1fd4e038544d4a6b80583d21febc8410 [2024-11-09 02:10:26,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:10:26,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:10:26,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:10:26,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:10:26,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:10:26,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:10:26" (1/1) ... [2024-11-09 02:10:26,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:26, skipping insertion in model container [2024-11-09 02:10:26,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:10:26" (1/1) ... [2024-11-09 02:10:27,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:10:27,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i[917,930] [2024-11-09 02:10:27,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:10:27,291 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:10:27,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i[917,930] [2024-11-09 02:10:27,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:10:27,385 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:10:27,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27 WrapperNode [2024-11-09 02:10:27,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:10:27,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:10:27,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:10:27,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:10:27,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,447 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 634 [2024-11-09 02:10:27,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:10:27,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:10:27,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:10:27,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:10:27,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,474 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:10:27,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:10:27,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:10:27,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:10:27,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:10:27,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (1/1) ... [2024-11-09 02:10:27,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:10:27,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:10:27,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:10:27,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:10:27,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:10:27,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:10:27,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:10:27,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:10:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:10:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:10:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:10:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:10:27,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:10:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:10:27,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:10:27,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:10:27,800 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:10:27,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:10:28,671 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-11-09 02:10:28,671 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:10:28,693 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:10:28,693 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:10:28,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:10:28 BoogieIcfgContainer [2024-11-09 02:10:28,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:10:28,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:10:28,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:10:28,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:10:28,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:10:26" (1/3) ... [2024-11-09 02:10:28,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f942a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:10:28, skipping insertion in model container [2024-11-09 02:10:28,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:27" (2/3) ... [2024-11-09 02:10:28,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f942a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:10:28, skipping insertion in model container [2024-11-09 02:10:28,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:10:28" (3/3) ... [2024-11-09 02:10:28,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-09 02:10:28,726 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:10:28,726 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:10:28,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:10:28,804 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;@c720394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:10:28,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:10:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 02:10:28,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:28,823 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:28,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:28,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash 37068822, now seen corresponding path program 1 times [2024-11-09 02:10:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:10:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189742086] [2024-11-09 02:10:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:28,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:10:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:10:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:10:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:10:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:10:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:10:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:10:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:10:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:10:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:10:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:10:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:10:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:10:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:10:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:10:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:10:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:10:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:10:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:10:29,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189742086] [2024-11-09 02:10:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189742086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:29,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:10:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112466321] [2024-11-09 02:10:29,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:29,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:10:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:10:29,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:10:29,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:10:29,508 INFO L87 Difference]: Start difference. First operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:29,543 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-09 02:10:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:10:29,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-09 02:10:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:29,554 INFO L225 Difference]: With dead ends: 281 [2024-11-09 02:10:29,554 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 02:10:29,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:10:29,565 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:29,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:10:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 02:10:29,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 02:10:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-11-09 02:10:29,619 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2024-11-09 02:10:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:29,619 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-11-09 02:10:29,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-11-09 02:10:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 02:10:29,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:29,628 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:29,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:10:29,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:29,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:29,629 INFO L85 PathProgramCache]: Analyzing trace with hash 332968922, now seen corresponding path program 1 times [2024-11-09 02:10:29,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:10:29,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788879145] [2024-11-09 02:10:29,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:10:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:10:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:10:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:10:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:10:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:10:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:10:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:10:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:10:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:10:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:10:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:10:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:10:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:10:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:10:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:10:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:10:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:10:30,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:10:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788879145] [2024-11-09 02:10:30,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788879145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:30,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:10:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827444404] [2024-11-09 02:10:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:10:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:10:30,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:10:30,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:30,113 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:30,178 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2024-11-09 02:10:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:10:30,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-09 02:10:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:30,186 INFO L225 Difference]: With dead ends: 279 [2024-11-09 02:10:30,187 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 02:10:30,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:30,190 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:30,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:10:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 02:10:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-09 02:10:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-09 02:10:30,214 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2024-11-09 02:10:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:30,215 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-09 02:10:30,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-09 02:10:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 02:10:30,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:30,222 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:30,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:10:30,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:30,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1327662620, now seen corresponding path program 1 times [2024-11-09 02:10:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:10:30,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976678131] [2024-11-09 02:10:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:10:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:10:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:10:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:10:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:10:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:10:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:10:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:10:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:10:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:10:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:10:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:10:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:10:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:10:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:10:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:10:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:10:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:10:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:10:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976678131] [2024-11-09 02:10:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976678131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:30,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:10:30,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499848797] [2024-11-09 02:10:30,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:30,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:10:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:10:30,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:10:30,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:30,658 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:30,690 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-09 02:10:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:10:30,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-09 02:10:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:30,699 INFO L225 Difference]: With dead ends: 283 [2024-11-09 02:10:30,701 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 02:10:30,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:30,703 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:30,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:10:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 02:10:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 02:10:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-09 02:10:30,724 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2024-11-09 02:10:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:30,726 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-09 02:10:30,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-09 02:10:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:10:30,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:30,729 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:30,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:10:30,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:30,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:30,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1021693129, now seen corresponding path program 1 times [2024-11-09 02:10:30,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:10:30,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712566163] [2024-11-09 02:10:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:30,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:10:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:10:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:10:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:10:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:10:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:10:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:10:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:10:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:10:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:10:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:10:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:10:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:30,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:10:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:10:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:10:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:10:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:10:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:10:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:10:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712566163] [2024-11-09 02:10:31,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712566163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:31,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:31,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:10:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557813694] [2024-11-09 02:10:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:10:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:10:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:10:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:31,025 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:31,065 INFO L93 Difference]: Finished difference Result 288 states and 423 transitions. [2024-11-09 02:10:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:10:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-09 02:10:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:31,070 INFO L225 Difference]: With dead ends: 288 [2024-11-09 02:10:31,070 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 02:10:31,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:31,072 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:31,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:10:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 02:10:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-09 02:10:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2024-11-09 02:10:31,090 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 143 [2024-11-09 02:10:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:31,091 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2024-11-09 02:10:31,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2024-11-09 02:10:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:10:31,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:31,094 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:31,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:10:31,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:31,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash -341634759, now seen corresponding path program 1 times [2024-11-09 02:10:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:10:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319248188] [2024-11-09 02:10:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:10:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:10:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:10:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:10:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:10:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:10:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:10:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:10:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:10:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:10:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:10:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:10:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:10:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:10:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:10:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:10:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:10:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:10:31,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:10:31,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319248188] [2024-11-09 02:10:31,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319248188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:31,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:31,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:10:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560962803] [2024-11-09 02:10:31,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:31,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:10:31,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:10:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:10:31,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:10:31,981 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:32,454 INFO L93 Difference]: Finished difference Result 351 states and 513 transitions. [2024-11-09 02:10:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:10:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-09 02:10:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:32,459 INFO L225 Difference]: With dead ends: 351 [2024-11-09 02:10:32,459 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 02:10:32,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:10:32,461 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 402 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:32,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 626 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:10:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 02:10:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 154. [2024-11-09 02:10:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 136 states have internal predecessors, (193), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 225 transitions. [2024-11-09 02:10:32,477 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 225 transitions. Word has length 143 [2024-11-09 02:10:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:32,477 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 225 transitions. [2024-11-09 02:10:32,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 225 transitions. [2024-11-09 02:10:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:10:32,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:32,482 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:32,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:10:32,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:32,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2068519753, now seen corresponding path program 1 times [2024-11-09 02:10:32,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:10:32,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145579215] [2024-11-09 02:10:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:32,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:10:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:10:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:10:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:10:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:10:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:10:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:10:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:10:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:10:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:10:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:10:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:10:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:10:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:10:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:10:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:10:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:10:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:10:33,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:10:33,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145579215] [2024-11-09 02:10:33,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145579215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:33,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:33,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:10:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052319515] [2024-11-09 02:10:33,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:33,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:10:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:10:33,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:10:33,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:10:33,530 INFO L87 Difference]: Start difference. First operand 154 states and 225 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:33,926 INFO L93 Difference]: Finished difference Result 372 states and 544 transitions. [2024-11-09 02:10:33,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:10:33,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-09 02:10:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:33,928 INFO L225 Difference]: With dead ends: 372 [2024-11-09 02:10:33,929 INFO L226 Difference]: Without dead ends: 221 [2024-11-09 02:10:33,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:10:33,930 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 409 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:33,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 670 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:10:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-09 02:10:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 176. [2024-11-09 02:10:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 158 states have (on average 1.4177215189873418) internal successors, (224), 158 states have internal predecessors, (224), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 256 transitions. [2024-11-09 02:10:33,950 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 256 transitions. Word has length 143 [2024-11-09 02:10:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:33,952 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 256 transitions. [2024-11-09 02:10:33,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 256 transitions. [2024-11-09 02:10:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:10:33,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:33,955 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:33,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:10:33,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:33,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1388461383, now seen corresponding path program 1 times [2024-11-09 02:10:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:10:33,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554114987] [2024-11-09 02:10:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:10:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:10:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:10:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:10:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:10:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:10:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:10:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:10:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:10:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:10:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:10:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:10:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:10:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:10:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:10:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:10:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:10:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:10:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:10:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554114987] [2024-11-09 02:10:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554114987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:34,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:34,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:10:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772721917] [2024-11-09 02:10:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:34,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:10:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:10:34,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:10:34,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:10:34,957 INFO L87 Difference]: Start difference. First operand 176 states and 256 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:35,366 INFO L93 Difference]: Finished difference Result 439 states and 634 transitions. [2024-11-09 02:10:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:10:35,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-09 02:10:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:35,369 INFO L225 Difference]: With dead ends: 439 [2024-11-09 02:10:35,369 INFO L226 Difference]: Without dead ends: 266 [2024-11-09 02:10:35,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:10:35,371 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 305 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:35,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 829 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:10:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-09 02:10:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 204. [2024-11-09 02:10:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 186 states have (on average 1.3978494623655915) internal successors, (260), 186 states have internal predecessors, (260), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 292 transitions. [2024-11-09 02:10:35,386 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 292 transitions. Word has length 143 [2024-11-09 02:10:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:35,387 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 292 transitions. [2024-11-09 02:10:35,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:35,387 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 292 transitions. [2024-11-09 02:10:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 02:10:35,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:35,390 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:35,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:10:35,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:35,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1947047509, now seen corresponding path program 1 times [2024-11-09 02:10:35,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:10:35,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760221404] [2024-11-09 02:10:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:10:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:10:35,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:10:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:10:35,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:10:35,740 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:10:35,741 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:10:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:10:35,746 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:35,905 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:10:35,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:10:35 BoogieIcfgContainer [2024-11-09 02:10:35,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:10:35,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:10:35,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:10:35,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:10:35,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:10:28" (3/4) ... [2024-11-09 02:10:35,914 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:10:35,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:10:35,916 INFO L158 Benchmark]: Toolchain (without parser) took 8932.48ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 104.6MB in the beginning and 122.7MB in the end (delta: -18.1MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2024-11-09 02:10:35,916 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 159.4MB. Free memory was 119.5MB in the beginning and 119.3MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:10:35,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.94ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 86.0MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 02:10:35,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.89ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 81.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:10:35,917 INFO L158 Benchmark]: Boogie Preprocessor took 72.39ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 77.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:10:35,917 INFO L158 Benchmark]: RCFGBuilder took 1173.78ms. Allocated memory is still 159.4MB. Free memory was 77.4MB in the beginning and 94.4MB in the end (delta: -17.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-09 02:10:35,918 INFO L158 Benchmark]: TraceAbstraction took 7212.28ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 93.6MB in the beginning and 122.7MB in the end (delta: -29.1MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. [2024-11-09 02:10:35,918 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 327.2MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:10:35,919 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.35ms. Allocated memory is still 159.4MB. Free memory was 119.5MB in the beginning and 119.3MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.94ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 86.0MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.89ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 81.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.39ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 77.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1173.78ms. Allocated memory is still 159.4MB. Free memory was 77.4MB in the beginning and 94.4MB in the end (delta: -17.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7212.28ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 93.6MB in the beginning and 122.7MB in the end (delta: -29.1MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 327.2MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 140. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] double* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] double* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] signed short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L65] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L66] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L67] signed short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L68] signed short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L69] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L70] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L71] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L72] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L73] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L74] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L75] unsigned char last_1_WrapperStruct00_var_1_15 = 16; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=0, last_1_WrapperStruct00_var_1_15=16] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] CALL updateLastVariables() [L137] EXPR WrapperStruct00.var_1_15 [L137] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L147] RET updateLastVariables() [L148] CALL updateVariables() [L108] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L111] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_3 [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_3 [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_4 [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_4 [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L116] EXPR WrapperStruct00.var_1_5 [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_5 [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L119] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L121] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L122] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L127] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L128] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L130] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L131] EXPR WrapperStruct00.var_1_14 [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L131] EXPR WrapperStruct00.var_1_14 [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L132] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L133] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L148] RET updateVariables() [L149] CALL step() [L79] (*(WrapperStruct00_var_1_12_Pointer)) = last_1_WrapperStruct00_var_1_15 [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] unsigned long int stepLocal_1 = (*(WrapperStruct00_var_1_12_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L81] signed short int stepLocal_0 = (*(WrapperStruct00_var_1_9_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_0=16383, stepLocal_1=16] [L82] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_10_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L89] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L92] COND FALSE !((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L95] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L100] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L100] (*(WrapperStruct00_var_1_6_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L103] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L103] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) [L149] RET step() [L150] CALL, EXPR property() [L140] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) [L140] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) [L140] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR ((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140-L141] return (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1117 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1117 mSDsluCounter, 4141 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2779 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 690 IncrementalHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1362 mSDtfsCounter, 690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 162 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1139 NumberOfCodeBlocks, 1139 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 2162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:10:35,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:10:38,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:10:38,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:10:38,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:10:38,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:10:38,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:10:38,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:10:38,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:10:38,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:10:38,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:10:38,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:10:38,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:10:38,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:10:38,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:10:38,301 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:10:38,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:10:38,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:10:38,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:10:38,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:10:38,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:10:38,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:10:38,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:10:38,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:10:38,307 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:10:38,308 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:10:38,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:10:38,309 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:10:38,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:10:38,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:10:38,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:10:38,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:10:38,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:10:38,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:10:38,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:10:38,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:10:38,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:10:38,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:10:38,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:10:38,313 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:10:38,313 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:10:38,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:10:38,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:10:38,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:10:38,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:10:38,314 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b [2024-11-09 02:10:38,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:10:38,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:10:38,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:10:38,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:10:38,692 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:10:38,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-09 02:10:40,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:10:40,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:10:40,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-09 02:10:40,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0360cb103/d33db73763b8491b8d5357f41b0ec639/FLAGa0e9e2372 [2024-11-09 02:10:40,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0360cb103/d33db73763b8491b8d5357f41b0ec639 [2024-11-09 02:10:40,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:10:40,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:10:40,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:10:40,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:10:40,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:10:40,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:10:40" (1/1) ... [2024-11-09 02:10:40,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a17adf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:40, skipping insertion in model container [2024-11-09 02:10:40,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:10:40" (1/1) ... [2024-11-09 02:10:40,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:10:40,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i[917,930] [2024-11-09 02:10:40,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:10:40,957 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:10:40,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i[917,930] [2024-11-09 02:10:41,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:10:41,040 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:10:41,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41 WrapperNode [2024-11-09 02:10:41,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:10:41,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:10:41,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:10:41,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:10:41,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,153 INFO L138 Inliner]: procedures = 40, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 631 [2024-11-09 02:10:41,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:10:41,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:10:41,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:10:41,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:10:41,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,224 INFO L175 MemorySlicer]: Split 157 memory accesses to 2 slices as follows [2, 155]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-09 02:10:41,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:10:41,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:10:41,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:10:41,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:10:41,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (1/1) ... [2024-11-09 02:10:41,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:10:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:10:41,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:10:41,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:10:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:10:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:10:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:10:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-09 02:10:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-09 02:10:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:10:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:10:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:10:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:10:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:10:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:10:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:10:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:10:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:10:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:10:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:10:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:10:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 02:10:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 02:10:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:10:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:10:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:10:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:10:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:10:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:10:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:10:41,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:10:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:10:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:10:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:10:41,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:10:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:10:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:10:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:10:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:10:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:10:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:10:41,615 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:10:41,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:10:48,444 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-11-09 02:10:48,444 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:10:48,465 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:10:48,466 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:10:48,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:10:48 BoogieIcfgContainer [2024-11-09 02:10:48,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:10:48,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:10:48,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:10:48,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:10:48,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:10:40" (1/3) ... [2024-11-09 02:10:48,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecee567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:10:48, skipping insertion in model container [2024-11-09 02:10:48,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:10:41" (2/3) ... [2024-11-09 02:10:48,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecee567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:10:48, skipping insertion in model container [2024-11-09 02:10:48,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:10:48" (3/3) ... [2024-11-09 02:10:48,477 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-17.i [2024-11-09 02:10:48,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:10:48,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:10:48,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:10:48,579 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;@11a54d54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:10:48,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:10:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 02:10:48,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:48,605 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:48,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:48,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash 220380826, now seen corresponding path program 1 times [2024-11-09 02:10:48,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:10:48,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759874064] [2024-11-09 02:10:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:48,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:10:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:10:48,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:10:48,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 02:10:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:49,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:10:49,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:10:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-09 02:10:49,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:10:49,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:10:49,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759874064] [2024-11-09 02:10:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759874064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:49,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:10:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492205009] [2024-11-09 02:10:49,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:49,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:10:49,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:10:49,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:10:49,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:10:49,280 INFO L87 Difference]: Start difference. First operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:49,322 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-09 02:10:49,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:10:49,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-09 02:10:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:49,335 INFO L225 Difference]: With dead ends: 281 [2024-11-09 02:10:49,335 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 02:10:49,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:10:49,346 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:49,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:10:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 02:10:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 02:10:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-11-09 02:10:49,407 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2024-11-09 02:10:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:49,409 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-11-09 02:10:49,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-11-09 02:10:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 02:10:49,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:49,416 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:49,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 02:10:49,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:10:49,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:49,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash 516280926, now seen corresponding path program 1 times [2024-11-09 02:10:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:10:49,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249073749] [2024-11-09 02:10:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:49,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:10:49,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:10:49,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:10:49,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 02:10:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:50,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:10:50,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:10:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-09 02:10:50,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:10:50,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:10:50,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249073749] [2024-11-09 02:10:50,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249073749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:50,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:50,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:10:50,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169588247] [2024-11-09 02:10:50,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:50,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:10:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:10:50,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:10:50,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:50,233 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:50,352 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2024-11-09 02:10:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:10:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-09 02:10:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:50,355 INFO L225 Difference]: With dead ends: 279 [2024-11-09 02:10:50,355 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 02:10:50,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:50,357 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:50,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:10:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 02:10:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-09 02:10:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-09 02:10:50,369 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2024-11-09 02:10:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:50,371 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-09 02:10:50,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-09 02:10:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 02:10:50,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:50,373 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:50,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 02:10:50,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:10:50,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:50,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash -430756960, now seen corresponding path program 1 times [2024-11-09 02:10:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:10:50,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292914050] [2024-11-09 02:10:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:10:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:10:50,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:10:50,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 02:10:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:51,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:10:51,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:10:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:10:51,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:10:51,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:10:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292914050] [2024-11-09 02:10:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292914050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:51,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:51,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:10:51,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428699572] [2024-11-09 02:10:51,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:51,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:10:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:10:51,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:10:51,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:51,173 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:10:51,357 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-09 02:10:51,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:10:51,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-09 02:10:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:10:51,364 INFO L225 Difference]: With dead ends: 283 [2024-11-09 02:10:51,368 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 02:10:51,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:10:51,370 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:10:51,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:10:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 02:10:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 02:10:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:10:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-09 02:10:51,390 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2024-11-09 02:10:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:10:51,391 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-09 02:10:51,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:10:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-09 02:10:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:10:51,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:10:51,394 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:10:51,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 02:10:51,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:10:51,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:10:51,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:10:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash 307378747, now seen corresponding path program 1 times [2024-11-09 02:10:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:10:51,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866510787] [2024-11-09 02:10:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:10:51,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:10:51,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:10:51,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:10:51,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 02:10:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:10:52,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:10:52,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:10:52,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:10:52,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 02:10:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-09 02:10:52,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:10:52,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:10:52,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866510787] [2024-11-09 02:10:52,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866510787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:10:52,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:10:52,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:10:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224702590] [2024-11-09 02:10:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:10:52,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:10:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:10:52,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:10:52,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:10:52,520 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:10:56,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:11:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:01,415 INFO L93 Difference]: Finished difference Result 286 states and 420 transitions. [2024-11-09 02:11:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:11:01,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-09 02:11:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:01,418 INFO L225 Difference]: With dead ends: 286 [2024-11-09 02:11:01,418 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 02:11:01,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:11:01,420 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 175 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:01,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 504 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2024-11-09 02:11:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 02:11:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-09 02:11:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:11:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-09 02:11:01,431 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 143 [2024-11-09 02:11:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:01,432 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-09 02:11:01,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:11:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-09 02:11:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 02:11:01,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:01,439 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:01,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 02:11:01,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:01,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:01,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash -161609983, now seen corresponding path program 1 times [2024-11-09 02:11:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:11:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811777593] [2024-11-09 02:11:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:01,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:11:01,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:11:01,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 02:11:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:02,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:11:02,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:11:02,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:11:02,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 02:11:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-09 02:11:02,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:11:02,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:11:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811777593] [2024-11-09 02:11:02,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811777593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:11:02,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:11:02,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:11:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264705774] [2024-11-09 02:11:02,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:11:02,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:11:02,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:11:02,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:11:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:11:02,610 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:11:06,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:11:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:10,973 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2024-11-09 02:11:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:11:10,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-09 02:11:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:10,975 INFO L225 Difference]: With dead ends: 286 [2024-11-09 02:11:10,975 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 02:11:10,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:11:10,977 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 166 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:10,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 498 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2024-11-09 02:11:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 02:11:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-09 02:11:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:11:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-11-09 02:11:10,986 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 145 [2024-11-09 02:11:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:10,987 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-11-09 02:11:10,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:11:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-11-09 02:11:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 02:11:10,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:10,989 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:11,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 02:11:11,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:11,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1042688005, now seen corresponding path program 1 times [2024-11-09 02:11:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:11:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35206181] [2024-11-09 02:11:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:11,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:11,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:11:11,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:11:11,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 02:11:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:11,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:11:11,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:11:12,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:11:12,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 02:11:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-09 02:11:12,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:11:12,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:11:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35206181] [2024-11-09 02:11:12,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35206181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:11:12,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:11:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:11:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109026681] [2024-11-09 02:11:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:11:12,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:11:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:11:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:11:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:11:12,130 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:11:16,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:11:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:19,902 INFO L93 Difference]: Finished difference Result 286 states and 416 transitions. [2024-11-09 02:11:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:11:19,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2024-11-09 02:11:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:19,905 INFO L225 Difference]: With dead ends: 286 [2024-11-09 02:11:19,905 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 02:11:19,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:11:19,910 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 138 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:19,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 494 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2024-11-09 02:11:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 02:11:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-09 02:11:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:11:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2024-11-09 02:11:19,921 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 147 [2024-11-09 02:11:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:19,922 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2024-11-09 02:11:19,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:11:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2024-11-09 02:11:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 02:11:19,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:19,925 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:19,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 02:11:20,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:20,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:20,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1669517631, now seen corresponding path program 1 times [2024-11-09 02:11:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:11:20,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228583518] [2024-11-09 02:11:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:20,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:11:20,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:11:20,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 02:11:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:20,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 02:11:20,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:11:21,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:21,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 02:11:21,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:11:23,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 02:11:23,179 INFO L349 Elim1Store]: treesize reduction 39, result has 27.8 percent of original size [2024-11-09 02:11:23,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2024-11-09 02:11:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:11:23,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:11:23,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:11:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228583518] [2024-11-09 02:11:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228583518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:11:23,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:11:23,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:11:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094314] [2024-11-09 02:11:23,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:11:23,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:11:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:11:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:11:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:11:23,485 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:27,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:11:31,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:11:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:40,363 INFO L93 Difference]: Finished difference Result 565 states and 817 transitions. [2024-11-09 02:11:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:11:40,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2024-11-09 02:11:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:40,367 INFO L225 Difference]: With dead ends: 565 [2024-11-09 02:11:40,367 INFO L226 Difference]: Without dead ends: 424 [2024-11-09 02:11:40,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:11:40,369 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 434 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:40,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 804 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 705 Invalid, 2 Unknown, 0 Unchecked, 16.6s Time] [2024-11-09 02:11:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-09 02:11:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 246. [2024-11-09 02:11:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 210 states have (on average 1.3714285714285714) internal successors, (288), 210 states have internal predecessors, (288), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 02:11:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 352 transitions. [2024-11-09 02:11:40,409 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 352 transitions. Word has length 149 [2024-11-09 02:11:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:40,410 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 352 transitions. [2024-11-09 02:11:40,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 352 transitions. [2024-11-09 02:11:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 02:11:40,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:40,414 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:40,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 02:11:40,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:40,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:40,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash -989459261, now seen corresponding path program 1 times [2024-11-09 02:11:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:11:40,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536473286] [2024-11-09 02:11:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:40,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:11:40,621 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:11:40,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 02:11:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:41,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 02:11:41,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:11:41,270 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-11-09 02:11:41,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-09 02:11:41,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:11:41,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2024-11-09 02:11:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:11:41,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:11:41,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:11:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536473286] [2024-11-09 02:11:41,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536473286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:11:41,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:11:41,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:11:41,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46536907] [2024-11-09 02:11:41,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:11:41,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:11:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:11:41,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:11:41,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:11:41,378 INFO L87 Difference]: Start difference. First operand 246 states and 352 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:45,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:11:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:48,511 INFO L93 Difference]: Finished difference Result 475 states and 682 transitions. [2024-11-09 02:11:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:11:48,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2024-11-09 02:11:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:48,514 INFO L225 Difference]: With dead ends: 475 [2024-11-09 02:11:48,514 INFO L226 Difference]: Without dead ends: 334 [2024-11-09 02:11:48,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:11:48,516 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:48,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 730 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-09 02:11:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-09 02:11:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 274. [2024-11-09 02:11:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 238 states have (on average 1.3697478991596639) internal successors, (326), 238 states have internal predecessors, (326), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 02:11:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 390 transitions. [2024-11-09 02:11:48,538 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 390 transitions. Word has length 149 [2024-11-09 02:11:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:48,538 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 390 transitions. [2024-11-09 02:11:48,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 390 transitions. [2024-11-09 02:11:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 02:11:48,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:48,542 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:48,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 02:11:48,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:48,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:48,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash 57367363, now seen corresponding path program 1 times [2024-11-09 02:11:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:11:48,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344117795] [2024-11-09 02:11:48,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:48,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:11:48,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:11:48,748 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:11:48,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 02:11:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:49,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 02:11:49,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:11:49,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 02:11:50,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2024-11-09 02:11:50,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2024-11-09 02:11:51,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33