./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_fillercode_fillercodestructure_filler-ps-co_file-30.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 e111ddb7b29b83b3c4c599c467dcaa70af487d74dbca60ec39ae91f7f9b2341e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:12:07,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:12:07,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:12:07,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:12:07,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:12:07,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:12:07,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:12:07,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:12:07,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:12:07,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:12:07,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:12:07,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:12:07,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:12:07,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:12:07,167 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:12:07,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:12:07,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:12:07,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:12:07,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:12:07,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:12:07,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:12:07,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:12:07,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:12:07,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:12:07,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:12:07,170 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> e111ddb7b29b83b3c4c599c467dcaa70af487d74dbca60ec39ae91f7f9b2341e [2025-03-08 13:12:07,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:12:07,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:12:07,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:12:07,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:12:07,434 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:12:07,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2025-03-08 13:12:08,619 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0dfc534/b842860d05214a9a9d78bc12daf984b1/FLAG76dbd79d4 [2025-03-08 13:12:08,869 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:12:08,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2025-03-08 13:12:08,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0dfc534/b842860d05214a9a9d78bc12daf984b1/FLAG76dbd79d4 [2025-03-08 13:12:08,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0dfc534/b842860d05214a9a9d78bc12daf984b1 [2025-03-08 13:12:08,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:12:08,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:12:08,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:12:08,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:12:08,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:12:08,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:12:08" (1/1) ... [2025-03-08 13:12:08,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4294bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:08, skipping insertion in model container [2025-03-08 13:12:08,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:12:08" (1/1) ... [2025-03-08 13:12:08,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:12:09,028 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_fillercode_fillercodestructure_filler-ps-co_file-30.i[919,932] [2025-03-08 13:12:09,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:12:09,110 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:12:09,118 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_fillercode_fillercodestructure_filler-ps-co_file-30.i[919,932] [2025-03-08 13:12:09,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:12:09,176 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:12:09,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09 WrapperNode [2025-03-08 13:12:09,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:12:09,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:12:09,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:12:09,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:12:09,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,225 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-03-08 13:12:09,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:12:09,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:12:09,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:12:09,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:12:09,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,258 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:12:09,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:12:09,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:12:09,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:12:09,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:12:09,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (1/1) ... [2025-03-08 13:12:09,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:12:09,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:12:09,301 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) [2025-03-08 13:12:09,306 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 [2025-03-08 13:12:09,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:12:09,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:12:09,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:12:09,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:12:09,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:12:09,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:12:09,398 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:12:09,400 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:12:09,646 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-08 13:12:09,681 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 13:12:09,681 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:12:09,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:12:09,701 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:12:09,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:12:09 BoogieIcfgContainer [2025-03-08 13:12:09,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:12:09,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:12:09,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:12:09,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:12:09,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:12:08" (1/3) ... [2025-03-08 13:12:09,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fff3343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:12:09, skipping insertion in model container [2025-03-08 13:12:09,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:09" (2/3) ... [2025-03-08 13:12:09,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fff3343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:12:09, skipping insertion in model container [2025-03-08 13:12:09,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:12:09" (3/3) ... [2025-03-08 13:12:09,709 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2025-03-08 13:12:09,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:12:09,721 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:12:09,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:12:09,779 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;@27b62f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:12:09,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:12:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 71 states have internal predecessors, (104), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:12:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 13:12:09,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:12:09,799 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:12:09,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:12:09,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:12:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1129698157, now seen corresponding path program 1 times [2025-03-08 13:12:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:12:09,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298258480] [2025-03-08 13:12:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:12:09,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 13:12:09,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 13:12:09,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:09,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 13:12:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:12:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298258480] [2025-03-08 13:12:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298258480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:12:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524765893] [2025-03-08 13:12:10,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:10,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:12:10,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:12:10,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:12:10,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:12:10,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 13:12:10,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 13:12:10,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:10,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:10,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:12:10,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:12:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 13:12:10,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:12:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524765893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:12:10,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:12:10,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:12:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465972290] [2025-03-08 13:12:10,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:12:10,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:12:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:12:10,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:12:10,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:12:10,325 INFO L87 Difference]: Start difference. First operand has 99 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 71 states have internal predecessors, (104), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:12:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:12:10,351 INFO L93 Difference]: Finished difference Result 192 states and 333 transitions. [2025-03-08 13:12:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:12:10,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2025-03-08 13:12:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:12:10,359 INFO L225 Difference]: With dead ends: 192 [2025-03-08 13:12:10,359 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 13:12:10,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:12:10,367 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:12:10,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:12:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 13:12:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 13:12:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:12:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 151 transitions. [2025-03-08 13:12:10,410 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 151 transitions. Word has length 177 [2025-03-08 13:12:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:12:10,412 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 151 transitions. [2025-03-08 13:12:10,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:12:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2025-03-08 13:12:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 13:12:10,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:12:10,416 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:12:10,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:12:10,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:12:10,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:12:10,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:12:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1841592785, now seen corresponding path program 1 times [2025-03-08 13:12:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:12:10,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784164528] [2025-03-08 13:12:10,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:12:10,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 13:12:10,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 13:12:10,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:10,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 13:12:10,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:12:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784164528] [2025-03-08 13:12:10,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784164528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:12:10,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:12:10,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:12:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135416536] [2025-03-08 13:12:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:12:10,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:12:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:12:10,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:12:10,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:12:10,983 INFO L87 Difference]: Start difference. First operand 96 states and 151 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:12:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:12:11,055 INFO L93 Difference]: Finished difference Result 282 states and 447 transitions. [2025-03-08 13:12:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:12:11,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-08 13:12:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:12:11,059 INFO L225 Difference]: With dead ends: 282 [2025-03-08 13:12:11,059 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 13:12:11,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:12:11,061 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 91 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:12:11,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 310 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:12:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 13:12:11,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-03-08 13:12:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:12:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 293 transitions. [2025-03-08 13:12:11,099 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 293 transitions. Word has length 177 [2025-03-08 13:12:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:12:11,100 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 293 transitions. [2025-03-08 13:12:11,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:12:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 293 transitions. [2025-03-08 13:12:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 13:12:11,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:12:11,104 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:12:11,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:12:11,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:12:11,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:12:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1200078415, now seen corresponding path program 1 times [2025-03-08 13:12:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:12:11,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544006900] [2025-03-08 13:12:11,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:12:11,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 13:12:11,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 13:12:11,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:11,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 13:12:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:12:11,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544006900] [2025-03-08 13:12:11,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544006900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:12:11,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:12:11,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:12:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743329136] [2025-03-08 13:12:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:12:11,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:12:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:12:11,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:12:11,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:12:11,408 INFO L87 Difference]: Start difference. First operand 187 states and 293 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:12:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:12:11,573 INFO L93 Difference]: Finished difference Result 400 states and 626 transitions. [2025-03-08 13:12:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:12:11,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-08 13:12:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:12:11,575 INFO L225 Difference]: With dead ends: 400 [2025-03-08 13:12:11,575 INFO L226 Difference]: Without dead ends: 216 [2025-03-08 13:12:11,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:12:11,577 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 155 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:12:11,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 450 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:12:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-08 13:12:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 187. [2025-03-08 13:12:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 132 states have internal predecessors, (188), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:12:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 292 transitions. [2025-03-08 13:12:11,599 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 292 transitions. Word has length 177 [2025-03-08 13:12:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:12:11,599 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 292 transitions. [2025-03-08 13:12:11,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:12:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2025-03-08 13:12:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 13:12:11,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:12:11,605 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:12:11,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:12:11,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:12:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:12:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash -160092307, now seen corresponding path program 1 times [2025-03-08 13:12:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:12:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031862681] [2025-03-08 13:12:11,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:12:11,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 13:12:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 13:12:11,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:11,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-08 13:12:12,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:12:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031862681] [2025-03-08 13:12:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031862681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:12:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879700197] [2025-03-08 13:12:12,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:12,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:12:12,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:12:12,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:12:12,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:12:12,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 13:12:12,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 13:12:12,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:12,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:12,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 13:12:12,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:12:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 52 proven. 144 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:12:12,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:12:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-08 13:12:13,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879700197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:12:13,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:12:13,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-03-08 13:12:13,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195460591] [2025-03-08 13:12:13,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:12:13,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 13:12:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:12:13,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 13:12:13,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:12:13,041 INFO L87 Difference]: Start difference. First operand 187 states and 292 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2025-03-08 13:12:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:12:13,380 INFO L93 Difference]: Finished difference Result 302 states and 458 transitions. [2025-03-08 13:12:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:12:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) Word has length 178 [2025-03-08 13:12:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:12:13,383 INFO L225 Difference]: With dead ends: 302 [2025-03-08 13:12:13,383 INFO L226 Difference]: Without dead ends: 209 [2025-03-08 13:12:13,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 350 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2025-03-08 13:12:13,384 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 352 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:12:13,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 363 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:12:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-08 13:12:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2025-03-08 13:12:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 144 states have internal predecessors, (195), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:12:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2025-03-08 13:12:13,413 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 178 [2025-03-08 13:12:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:12:13,414 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2025-03-08 13:12:13,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2025-03-08 13:12:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2025-03-08 13:12:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 13:12:13,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:12:13,418 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:12:13,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:12:13,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 13:12:13,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:12:13,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:12:13,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1766492911, now seen corresponding path program 1 times [2025-03-08 13:12:13,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:12:13,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432780180] [2025-03-08 13:12:13,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:13,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:12:13,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 13:12:13,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 13:12:13,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:13,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 13:12:13,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:12:13,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432780180] [2025-03-08 13:12:13,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432780180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:12:13,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:12:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:12:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585842124] [2025-03-08 13:12:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:12:13,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:12:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:12:13,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:12:13,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:12:13,730 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:12:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:12:13,772 INFO L93 Difference]: Finished difference Result 403 states and 595 transitions. [2025-03-08 13:12:13,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:12:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2025-03-08 13:12:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:12:13,776 INFO L225 Difference]: With dead ends: 403 [2025-03-08 13:12:13,778 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 13:12:13,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:12:13,779 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:12:13,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:12:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 13:12:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-08 13:12:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 144 states have internal predecessors, (193), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:12:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 297 transitions. [2025-03-08 13:12:13,801 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 297 transitions. Word has length 179 [2025-03-08 13:12:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:12:13,801 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 297 transitions. [2025-03-08 13:12:13,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:12:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 297 transitions. [2025-03-08 13:12:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 13:12:13,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:12:13,803 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:12:13,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:12:13,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:12:13,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:12:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash 516121073, now seen corresponding path program 1 times [2025-03-08 13:12:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:12:13,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401958015] [2025-03-08 13:12:13,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:12:13,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 13:12:13,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 13:12:13,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:13,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:12:13,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:12:13,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 13:12:13,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 13:12:13,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:13,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:12:13,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:12:13,990 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:12:13,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:12:13,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:12:13,997 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 13:12:14,119 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:12:14,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:12:14 BoogieIcfgContainer [2025-03-08 13:12:14,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:12:14,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:12:14,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:12:14,126 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:12:14,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:12:09" (3/4) ... [2025-03-08 13:12:14,129 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:12:14,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:12:14,131 INFO L158 Benchmark]: Toolchain (without parser) took 5240.43ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 124.3MB in the beginning and 145.7MB in the end (delta: -21.5MB). Peak memory consumption was 189.8MB. Max. memory is 16.1GB. [2025-03-08 13:12:14,131 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:12:14,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.91ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 108.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:12:14,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.94ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:12:14,132 INFO L158 Benchmark]: Boogie Preprocessor took 43.39ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:12:14,133 INFO L158 Benchmark]: IcfgBuilder took 428.81ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 80.8MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 13:12:14,133 INFO L158 Benchmark]: TraceAbstraction took 4422.10ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 79.9MB in the beginning and 145.8MB in the end (delta: -65.9MB). Peak memory consumption was 147.9MB. Max. memory is 16.1GB. [2025-03-08 13:12:14,133 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 377.5MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:12:14,134 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.21ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.91ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 108.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.94ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.39ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 428.81ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 80.8MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4422.10ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 79.9MB in the beginning and 145.8MB in the end (delta: -65.9MB). Peak memory consumption was 147.9MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 377.5MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 30.1kB). 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 someBinaryArithmeticDOUBLEoperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 186, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 171, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryArithmeticFLOAToperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_21 = 100.4; [L37] signed long int var_1_24 = 10; [L38] signed char var_1_25 = -8; [L39] double var_1_26 = 9.75; [L40] signed char var_1_28 = 8; [L41] unsigned long int var_1_29 = 16; [L42] unsigned long int var_1_30 = 1; [L43] float var_1_31 = 16.6; [L44] float var_1_33 = 0.25; [L45] float var_1_34 = 99.8; [L46] signed short int var_1_35 = 256; [L47] unsigned long int var_1_36 = 16; [L48] double var_1_37 = 8.5; [L49] unsigned long int var_1_38 = 3569725445; [L50] unsigned long int var_1_39 = 3551809449; [L51] unsigned long int var_1_40 = 10000000; [L52] unsigned char last_1_var_1_1 = 1; [L53] signed long int last_1_var_1_11 = -2; [L54] signed long int last_1_var_1_15 = 1000; [L55] double last_1_var_1_16 = 0.2; VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] CALL updateLastVariables() [L198] last_1_var_1_1 = var_1_1 [L199] last_1_var_1_11 = var_1_11 [L200] last_1_var_1_15 = var_1_15 [L201] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L211] RET updateLastVariables() [L212] CALL updateVariables() [L153] var_1_4 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L154] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L155] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L155] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L156] var_1_7 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L158] var_1_10 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] var_1_13 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L161] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] var_1_14 = __VERIFIER_nondet_long() [L164] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] var_1_17 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] var_1_18 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] var_1_26 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] var_1_28 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] var_1_30 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L181] var_1_33 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L183] var_1_34 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L184] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] var_1_37 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L186] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L187] var_1_38 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L190] var_1_39 = __VERIFIER_nondet_ulong() [L191] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L193] var_1_40 = __VERIFIER_nondet_ulong() [L194] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] RET updateVariables() [L213] CALL step() [L59] COND TRUE (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) - var_1_21) == (var_1_8 * var_1_16) [L60] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L62] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L63] COND TRUE var_1_21 != var_1_5 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L64] COND TRUE var_1_5 < (var_1_5 / var_1_26) [L65] var_1_25 = ((((4) < 0 ) ? -(4) : (4))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L76] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L77] COND FALSE !(var_1_16 > var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L84] COND TRUE \read(var_1_1) [L85] var_1_31 = ((((((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) < 0 ) ? -((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) : ((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L88] COND FALSE !(! ((1 + var_1_11) <= var_1_15)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L93] COND FALSE !(var_1_21 < var_1_5) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L100] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L101] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L102] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L107] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L108] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L109] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L111] signed long int stepLocal_2 = var_1_11; [L112] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L114] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L115] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L116] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L122] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L122] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L133] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L135] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L136] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L140] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L141] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L142] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L213] RET step() [L214] CALL, EXPR property() [L204] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L204-L205] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 182 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 599 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 598 mSDsluCounter, 1530 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 772 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 758 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 5 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1423 NumberOfCodeBlocks, 1423 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1413 ConstructedInterpolants, 0 QuantifiedInterpolants, 2851 SizeOfPredicates, 1 NumberOfNonLiveVariables, 827 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 10056/10400 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:12:14,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_fillercode_fillercodestructure_filler-ps-co_file-30.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 e111ddb7b29b83b3c4c599c467dcaa70af487d74dbca60ec39ae91f7f9b2341e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:12:16,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:12:16,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:12:16,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:12:16,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:12:16,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:12:16,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:12:16,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:12:16,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:12:16,196 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:12:16,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:12:16,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:12:16,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:12:16,197 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:12:16,198 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:12:16,198 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:12:16,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:12:16,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:12:16,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:12:16,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:12:16,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:12:16,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:12:16,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:12:16,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:12:16,201 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> e111ddb7b29b83b3c4c599c467dcaa70af487d74dbca60ec39ae91f7f9b2341e [2025-03-08 13:12:16,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:12:16,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:12:16,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:12:16,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:12:16,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:12:16,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2025-03-08 13:12:17,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb83f60a/0455dce884014fdfa79fc6d98cb9fc1f/FLAG668b8514b [2025-03-08 13:12:17,894 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:12:17,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2025-03-08 13:12:17,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb83f60a/0455dce884014fdfa79fc6d98cb9fc1f/FLAG668b8514b [2025-03-08 13:12:17,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb83f60a/0455dce884014fdfa79fc6d98cb9fc1f [2025-03-08 13:12:17,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:12:17,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:12:17,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:12:17,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:12:17,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:12:17,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:12:17" (1/1) ... [2025-03-08 13:12:17,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729c9a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:17, skipping insertion in model container [2025-03-08 13:12:17,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:12:17" (1/1) ... [2025-03-08 13:12:17,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:12:18,065 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_fillercode_fillercodestructure_filler-ps-co_file-30.i[919,932] [2025-03-08 13:12:18,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:12:18,156 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:12:18,164 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_fillercode_fillercodestructure_filler-ps-co_file-30.i[919,932] [2025-03-08 13:12:18,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:12:18,200 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:12:18,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18 WrapperNode [2025-03-08 13:12:18,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:12:18,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:12:18,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:12:18,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:12:18,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,234 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2025-03-08 13:12:18,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:12:18,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:12:18,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:12:18,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:12:18,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,271 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:12:18,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:12:18,287 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:12:18,287 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:12:18,287 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:12:18,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (1/1) ... [2025-03-08 13:12:18,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:12:18,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:12:18,316 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) [2025-03-08 13:12:18,322 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 [2025-03-08 13:12:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:12:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:12:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:12:18,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:12:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:12:18,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:12:18,433 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:12:18,435 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:12:38,302 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:12:38,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:12:38,310 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:12:38,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:12:38,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:12:38 BoogieIcfgContainer [2025-03-08 13:12:38,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:12:38,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:12:38,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:12:38,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:12:38,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:12:17" (1/3) ... [2025-03-08 13:12:38,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492e3597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:12:38, skipping insertion in model container [2025-03-08 13:12:38,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:12:18" (2/3) ... [2025-03-08 13:12:38,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492e3597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:12:38, skipping insertion in model container [2025-03-08 13:12:38,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:12:38" (3/3) ... [2025-03-08 13:12:38,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2025-03-08 13:12:38,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:12:38,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:12:38,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:12:38,379 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;@1c2b45c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:12:38,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:12:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:12:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 13:12:38,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:12:38,395 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:12:38,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:12:38,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:12:38,399 INFO L85 PathProgramCache]: Analyzing trace with hash 290659195, now seen corresponding path program 1 times [2025-03-08 13:12:38,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:12:38,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636342533] [2025-03-08 13:12:38,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:38,410 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 [2025-03-08 13:12:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:12:38,414 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) [2025-03-08 13:12:38,416 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 [2025-03-08 13:12:38,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 13:12:39,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 13:12:39,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:39,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:39,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:12:39,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:12:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-08 13:12:39,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:12:39,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:12:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636342533] [2025-03-08 13:12:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636342533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:12:39,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:12:39,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:12:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297141291] [2025-03-08 13:12:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:12:39,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:12:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:12:39,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:12:39,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:12:39,768 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:12:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:12:39,786 INFO L93 Difference]: Finished difference Result 172 states and 301 transitions. [2025-03-08 13:12:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:12:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-03-08 13:12:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:12:39,794 INFO L225 Difference]: With dead ends: 172 [2025-03-08 13:12:39,795 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 13:12:39,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:12:39,799 INFO L435 NwaCegarLoop]: 132 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, 132 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 [2025-03-08 13:12:39,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:12:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 13:12:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-08 13:12:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:12:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-08 13:12:39,834 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 174 [2025-03-08 13:12:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:12:39,834 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-08 13:12:39,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:12:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-08 13:12:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 13:12:39,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:12:39,837 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:12:39,871 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 [2025-03-08 13:12:40,037 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 [2025-03-08 13:12:40,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:12:40,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:12:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash -300291111, now seen corresponding path program 1 times [2025-03-08 13:12:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:12:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791739330] [2025-03-08 13:12:40,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:12:40,039 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 [2025-03-08 13:12:40,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:12:40,041 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) [2025-03-08 13:12:40,042 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 [2025-03-08 13:12:40,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 13:12:41,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 13:12:41,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:12:41,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:12:41,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:12:41,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:12:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 13:12:44,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:12:44,319 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:12:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791739330] [2025-03-08 13:12:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791739330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:12:44,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:12:44,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:12:44,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329511390] [2025-03-08 13:12:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:12:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:12:44,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:12:44,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:12:44,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:12:44,323 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:12:48,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:12:52,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:12:56,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:13:00,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:13:04,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:13:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:13:04,372 INFO L93 Difference]: Finished difference Result 267 states and 418 transitions. [2025-03-08 13:13:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:13:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-08 13:13:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:13:04,423 INFO L225 Difference]: With dead ends: 267 [2025-03-08 13:13:04,423 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 13:13:04,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:13:04,424 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 116 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 57 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2025-03-08 13:13:04,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 390 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 19.9s Time] [2025-03-08 13:13:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 13:13:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2025-03-08 13:13:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:13:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 255 transitions. [2025-03-08 13:13:04,452 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 255 transitions. Word has length 174 [2025-03-08 13:13:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:13:04,453 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 255 transitions. [2025-03-08 13:13:04,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:13:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 255 transitions. [2025-03-08 13:13:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:13:04,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:13:04,455 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:13:04,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:13:04,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:13:04,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:13:04,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:13:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash 736806186, now seen corresponding path program 1 times [2025-03-08 13:13:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:13:04,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74227091] [2025-03-08 13:13:04,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:13:04,657 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 [2025-03-08 13:13:04,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:13:04,659 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) [2025-03-08 13:13:04,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:13:04,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:13:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:13:05,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:13:05,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:13:05,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 13:13:05,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:13:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 52 proven. 144 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:13:12,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:13:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-08 13:13:15,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:13:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74227091] [2025-03-08 13:13:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74227091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:13:15,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:13:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2025-03-08 13:13:15,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077984604] [2025-03-08 13:13:15,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:13:15,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:13:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:13:15,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:13:15,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:13:15,417 INFO L87 Difference]: Start difference. First operand 165 states and 255 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2025-03-08 13:13:23,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:13:27,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:13:29,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:13:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:13:29,789 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2025-03-08 13:13:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:13:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) Word has length 175 [2025-03-08 13:13:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:13:29,792 INFO L225 Difference]: With dead ends: 269 [2025-03-08 13:13:29,792 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 13:13:29,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2025-03-08 13:13:29,793 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 228 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 109 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:13:29,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 299 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 242 Invalid, 2 Unknown, 0 Unchecked, 13.3s Time] [2025-03-08 13:13:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 13:13:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2025-03-08 13:13:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:13:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 263 transitions. [2025-03-08 13:13:29,821 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 263 transitions. Word has length 175 [2025-03-08 13:13:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:13:29,822 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 263 transitions. [2025-03-08 13:13:29,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2025-03-08 13:13:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 263 transitions. [2025-03-08 13:13:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 13:13:29,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:13:29,826 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:13:29,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 13:13:30,026 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 [2025-03-08 13:13:30,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:13:30,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:13:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1909712615, now seen corresponding path program 1 times [2025-03-08 13:13:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:13:30,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577038736] [2025-03-08 13:13:30,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:13:30,027 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 [2025-03-08 13:13:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:13:30,031 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) [2025-03-08 13:13:30,032 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 [2025-03-08 13:13:30,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 13:13:31,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 13:13:31,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:13:31,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:13:31,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 13:13:31,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:13:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 13:13:31,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:13:31,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:13:31,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577038736] [2025-03-08 13:13:31,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577038736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:13:31,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:13:31,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:13:31,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518355581] [2025-03-08 13:13:31,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:13:31,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:13:31,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:13:31,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:13:31,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:13:31,330 INFO L87 Difference]: Start difference. First operand 181 states and 263 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:13:36,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:13:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:13:36,217 INFO L93 Difference]: Finished difference Result 359 states and 523 transitions. [2025-03-08 13:13:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:13:36,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-08 13:13:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:13:36,221 INFO L225 Difference]: With dead ends: 359 [2025-03-08 13:13:36,221 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 13:13:36,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:13:36,222 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 13:13:36,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 13:13:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 13:13:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-08 13:13:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:13:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 261 transitions. [2025-03-08 13:13:36,245 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 261 transitions. Word has length 176 [2025-03-08 13:13:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:13:36,245 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 261 transitions. [2025-03-08 13:13:36,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:13:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 261 transitions. [2025-03-08 13:13:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 13:13:36,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:13:36,247 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:13:36,283 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 [2025-03-08 13:13:36,447 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 [2025-03-08 13:13:36,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:13:36,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:13:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 874465094, now seen corresponding path program 1 times [2025-03-08 13:13:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:13:36,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376675935] [2025-03-08 13:13:36,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:13:36,448 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 [2025-03-08 13:13:36,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:13:36,450 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) [2025-03-08 13:13:36,451 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 [2025-03-08 13:13:36,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 13:13:37,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 13:13:37,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:13:37,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:13:37,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 13:13:37,688 INFO L279 TraceCheckSpWp]: Computing forward predicates...