./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:50:51,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:50:51,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:50:51,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:50:51,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:50:51,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:50:51,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:50:51,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:50:51,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:50:51,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:50:51,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:50:51,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:50:51,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:50:51,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:50:51,341 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:50:51,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:50:51,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:50:51,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:50:51,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:50:51,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:50:51,344 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-jdk21/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 -> 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb [2025-02-05 22:50:51,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:50:51,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:50:51,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:50:51,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:50:51,657 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:50:51,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2025-02-05 22:50:53,033 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cee344df2/c1cc49ae854c49a79851621bfdf0d91d/FLAG537fe93b2 [2025-02-05 22:50:53,325 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:50:53,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2025-02-05 22:50:53,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cee344df2/c1cc49ae854c49a79851621bfdf0d91d/FLAG537fe93b2 [2025-02-05 22:50:53,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cee344df2/c1cc49ae854c49a79851621bfdf0d91d [2025-02-05 22:50:53,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:50:53,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:50:53,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:50:53,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:50:53,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:50:53,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120706b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53, skipping insertion in model container [2025-02-05 22:50:53,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:50:53,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2025-02-05 22:50:53,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:50:53,649 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:50:53,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2025-02-05 22:50:53,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:50:53,730 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:50:53,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53 WrapperNode [2025-02-05 22:50:53,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:50:53,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:50:53,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:50:53,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:50:53,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,804 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-02-05 22:50:53,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:50:53,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:50:53,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:50:53,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:50:53,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,840 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-02-05 22:50:53,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:50:53,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:50:53,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:50:53,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:50:53,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (1/1) ... [2025-02-05 22:50:53,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:50:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:50:53,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:50:53,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:50:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:50:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:50:53,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:50:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:50:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:50:53,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:50:54,024 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:50:54,026 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:50:54,441 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:50:54,441 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:50:54,457 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:50:54,458 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 22:50:54,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:50:54 BoogieIcfgContainer [2025-02-05 22:50:54,458 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:50:54,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:50:54,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:50:54,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:50:54,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:50:53" (1/3) ... [2025-02-05 22:50:54,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f3aa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:50:54, skipping insertion in model container [2025-02-05 22:50:54,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:50:53" (2/3) ... [2025-02-05 22:50:54,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f3aa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:50:54, skipping insertion in model container [2025-02-05 22:50:54,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:50:54" (3/3) ... [2025-02-05 22:50:54,470 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2025-02-05 22:50:54,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:50:54,490 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:50:54,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:50:54,567 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;@247e840e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:50:54,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:50:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:50:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 22:50:54,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:50:54,592 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:50:54,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:50:54,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:50:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2060335897, now seen corresponding path program 1 times [2025-02-05 22:50:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:50:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338904825] [2025-02-05 22:50:54,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:50:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:50:54,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 22:50:54,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 22:50:54,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:50:54,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:50:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 22:50:54,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:50:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338904825] [2025-02-05 22:50:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338904825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:50:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158770855] [2025-02-05 22:50:54,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:50:54,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:50:54,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:50:54,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:50:54,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:50:55,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 22:50:55,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 22:50:55,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:50:55,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:50:55,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:50:55,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:50:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 22:50:55,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:50:55,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158770855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:50:55,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:50:55,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:50:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236905576] [2025-02-05 22:50:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:50:55,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:50:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:50:55,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:50:55,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:50:55,262 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:50:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:50:55,302 INFO L93 Difference]: Finished difference Result 172 states and 303 transitions. [2025-02-05 22:50:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:50:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 190 [2025-02-05 22:50:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:50:55,312 INFO L225 Difference]: With dead ends: 172 [2025-02-05 22:50:55,314 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 22:50:55,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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-02-05 22:50:55,323 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:50:55,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:50:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 22:50:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-05 22:50:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:50:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2025-02-05 22:50:55,373 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 190 [2025-02-05 22:50:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:50:55,375 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2025-02-05 22:50:55,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:50:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2025-02-05 22:50:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 22:50:55,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:50:55,382 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:50:55,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:50:55,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:50:55,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:50:55,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:50:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1164187291, now seen corresponding path program 1 times [2025-02-05 22:50:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:50:55,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120692502] [2025-02-05 22:50:55,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:50:55,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:50:55,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 22:50:55,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 22:50:55,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:50:55,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:50:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:50:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:50:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120692502] [2025-02-05 22:50:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120692502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:50:55,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:50:55,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:50:55,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830502517] [2025-02-05 22:50:55,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:50:55,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:50:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:50:55,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:50:55,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:50:55,938 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:50:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:50:56,043 INFO L93 Difference]: Finished difference Result 242 states and 377 transitions. [2025-02-05 22:50:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:50:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2025-02-05 22:50:56,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:50:56,053 INFO L225 Difference]: With dead ends: 242 [2025-02-05 22:50:56,054 INFO L226 Difference]: Without dead ends: 159 [2025-02-05 22:50:56,054 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-02-05 22:50:56,055 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 108 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:50:56,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 249 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:50:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-05 22:50:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 95. [2025-02-05 22:50:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:50:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2025-02-05 22:50:56,083 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 190 [2025-02-05 22:50:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:50:56,085 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2025-02-05 22:50:56,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:50:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2025-02-05 22:50:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 22:50:56,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:50:56,088 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:50:56,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:50:56,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:50:56,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:50:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1035104572, now seen corresponding path program 1 times [2025-02-05 22:50:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:50:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539886999] [2025-02-05 22:50:56,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:50:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:50:56,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 22:50:56,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 22:50:56,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:50:56,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:50:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:50:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:50:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539886999] [2025-02-05 22:50:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539886999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:50:56,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:50:56,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:50:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800863646] [2025-02-05 22:50:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:50:56,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:50:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:50:56,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:50:56,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:50:56,250 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:50:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:50:56,335 INFO L93 Difference]: Finished difference Result 251 states and 388 transitions. [2025-02-05 22:50:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:50:56,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2025-02-05 22:50:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:50:56,339 INFO L225 Difference]: With dead ends: 251 [2025-02-05 22:50:56,339 INFO L226 Difference]: Without dead ends: 159 [2025-02-05 22:50:56,339 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-02-05 22:50:56,343 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 112 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:50:56,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 340 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:50:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-05 22:50:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 95. [2025-02-05 22:50:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:50:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2025-02-05 22:50:56,369 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 190 [2025-02-05 22:50:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:50:56,370 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2025-02-05 22:50:56,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:50:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2025-02-05 22:50:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 22:50:56,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:50:56,376 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:50:56,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:50:56,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:50:56,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:50:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash -560567569, now seen corresponding path program 1 times [2025-02-05 22:50:56,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:50:56,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898556145] [2025-02-05 22:50:56,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:50:56,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:50:56,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:50:56,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:50:56,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:50:56,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:50:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:50:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:50:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898556145] [2025-02-05 22:50:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898556145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:50:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:50:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:50:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206666522] [2025-02-05 22:50:56,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:50:56,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:50:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:50:56,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:50:56,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:50:56,999 INFO L87 Difference]: Start difference. First operand 95 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:50:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:50:57,363 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2025-02-05 22:50:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:50:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-02-05 22:50:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:50:57,367 INFO L225 Difference]: With dead ends: 306 [2025-02-05 22:50:57,367 INFO L226 Difference]: Without dead ends: 214 [2025-02-05 22:50:57,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:50:57,368 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 139 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:50:57,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 621 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:50:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-05 22:50:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 177. [2025-02-05 22:50:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:50:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 270 transitions. [2025-02-05 22:50:57,418 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 270 transitions. Word has length 191 [2025-02-05 22:50:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:50:57,419 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 270 transitions. [2025-02-05 22:50:57,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:50:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 270 transitions. [2025-02-05 22:50:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 22:50:57,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:50:57,422 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:50:57,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:50:57,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:50:57,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:50:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1913877266, now seen corresponding path program 1 times [2025-02-05 22:50:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:50:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353155333] [2025-02-05 22:50:57,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:50:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:50:57,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:50:57,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:50:57,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:50:57,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:50:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:50:58,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:50:58,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353155333] [2025-02-05 22:50:58,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353155333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:50:58,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:50:58,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:50:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812138363] [2025-02-05 22:50:58,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:50:58,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:50:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:50:58,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:50:58,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:50:58,276 INFO L87 Difference]: Start difference. First operand 177 states and 270 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:50:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:50:58,691 INFO L93 Difference]: Finished difference Result 362 states and 552 transitions. [2025-02-05 22:50:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:50:58,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-02-05 22:50:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:50:58,694 INFO L225 Difference]: With dead ends: 362 [2025-02-05 22:50:58,694 INFO L226 Difference]: Without dead ends: 188 [2025-02-05 22:50:58,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:50:58,698 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 84 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:50:58,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 422 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:50:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-05 22:50:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 153. [2025-02-05 22:50:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 90 states have internal predecessors, (113), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:50:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2025-02-05 22:50:58,748 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 191 [2025-02-05 22:50:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:50:58,749 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2025-02-05 22:50:58,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:50:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2025-02-05 22:50:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 22:50:58,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:50:58,754 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:50:58,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:50:58,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:50:58,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:50:58,755 INFO L85 PathProgramCache]: Analyzing trace with hash 408779457, now seen corresponding path program 1 times [2025-02-05 22:50:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:50:58,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108114229] [2025-02-05 22:50:58,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:50:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:50:58,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 22:50:58,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 22:50:58,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:50:58,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:50:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:50:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:50:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108114229] [2025-02-05 22:50:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108114229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:50:59,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:50:59,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:50:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555151956] [2025-02-05 22:50:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:50:59,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:50:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:50:59,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:50:59,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:50:59,554 INFO L87 Difference]: Start difference. First operand 153 states and 233 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:51:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:51:00,045 INFO L93 Difference]: Finished difference Result 270 states and 410 transitions. [2025-02-05 22:51:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:51:00,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2025-02-05 22:51:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:51:00,048 INFO L225 Difference]: With dead ends: 270 [2025-02-05 22:51:00,048 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 22:51:00,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:51:00,052 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 153 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:51:00,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 414 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:51:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 22:51:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2025-02-05 22:51:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:51:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 238 transitions. [2025-02-05 22:51:00,099 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 238 transitions. Word has length 192 [2025-02-05 22:51:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:51:00,100 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 238 transitions. [2025-02-05 22:51:00,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:51:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 238 transitions. [2025-02-05 22:51:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 22:51:00,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:51:00,105 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:51:00,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:51:00,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:51:00,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:51:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1011720442, now seen corresponding path program 1 times [2025-02-05 22:51:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:51:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549195965] [2025-02-05 22:51:00,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:51:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:51:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 22:51:00,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 22:51:00,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:51:00,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:51:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:51:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:51:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549195965] [2025-02-05 22:51:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549195965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:51:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984099151] [2025-02-05 22:51:01,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:51:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:51:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:51:01,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:51:01,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:51:01,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 22:51:01,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 22:51:01,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:51:01,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:51:01,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 22:51:01,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:51:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-02-05 22:51:01,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:51:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:51:02,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984099151] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:51:02,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:51:02,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-02-05 22:51:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591359955] [2025-02-05 22:51:02,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:51:02,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 22:51:02,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:51:02,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 22:51:02,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:51:02,032 INFO L87 Difference]: Start difference. First operand 157 states and 238 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (77), 2 states have call predecessors, (77), 4 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2025-02-05 22:51:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:51:03,947 INFO L93 Difference]: Finished difference Result 362 states and 532 transitions. [2025-02-05 22:51:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 22:51:03,947 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (77), 2 states have call predecessors, (77), 4 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) Word has length 194 [2025-02-05 22:51:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:51:03,950 INFO L225 Difference]: With dead ends: 362 [2025-02-05 22:51:03,952 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 22:51:03,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 383 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 22:51:03,954 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 456 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:51:03,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 853 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 22:51:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 22:51:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2025-02-05 22:51:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:51:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2025-02-05 22:51:04,006 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 194 [2025-02-05 22:51:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:51:04,006 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2025-02-05 22:51:04,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (77), 2 states have call predecessors, (77), 4 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2025-02-05 22:51:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2025-02-05 22:51:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 22:51:04,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:51:04,009 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:51:04,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:51:04,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:51:04,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:51:04,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:51:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1929937157, now seen corresponding path program 1 times [2025-02-05 22:51:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:51:04,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571676464] [2025-02-05 22:51:04,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:51:04,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:51:04,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 22:51:04,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 22:51:04,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:51:04,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:51:04,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266871322] [2025-02-05 22:51:04,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:51:04,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:51:04,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:51:04,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:51:04,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:51:04,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 22:51:04,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 22:51:04,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:51:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:51:04,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:51:04,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 22:51:04,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 22:51:04,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:51:04,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:51:04,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:51:04,761 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:51:04,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:51:04,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 22:51:04,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:51:04,967 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:51:05,148 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:51:05,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:51:05 BoogieIcfgContainer [2025-02-05 22:51:05,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:51:05,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:51:05,153 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:51:05,153 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:51:05,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:50:54" (3/4) ... [2025-02-05 22:51:05,155 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:51:05,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:51:05,158 INFO L158 Benchmark]: Toolchain (without parser) took 11804.48ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 104.6MB in the beginning and 250.8MB in the end (delta: -146.2MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2025-02-05 22:51:05,158 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:51:05,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.25ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 88.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:51:05,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.67ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 84.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:51:05,159 INFO L158 Benchmark]: Boogie Preprocessor took 52.94ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 80.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:51:05,160 INFO L158 Benchmark]: IcfgBuilder took 599.80ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 54.6MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 22:51:05,160 INFO L158 Benchmark]: TraceAbstraction took 10691.14ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 53.7MB in the beginning and 251.0MB in the end (delta: -197.3MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2025-02-05 22:51:05,160 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 419.4MB. Free memory was 251.0MB in the beginning and 250.8MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:51:05,162 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.41ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.25ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 88.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.67ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 84.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.94ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 80.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 599.80ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 54.6MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10691.14ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 53.7MB in the beginning and 251.0MB in the end (delta: -197.3MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 419.4MB. Free memory was 251.0MB in the beginning and 250.8MB in the end (delta: 129.3kB). 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 someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 164. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_27 = 4; [L40] float var_1_28 = 8.95; [L41] float var_1_29 = 63.75; [L42] signed short int var_1_30 = -256; [L43] unsigned char var_1_31 = 0; [L44] double var_1_32 = 99999999999.2; [L45] double var_1_33 = 31.2; [L46] unsigned char var_1_35 = 1; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] unsigned char var_1_38 = 1; [L50] unsigned short int var_1_39 = 4; [L51] unsigned char var_1_40 = 4; [L52] unsigned char var_1_41 = 10; [L53] unsigned long int last_1_var_1_1 = 1000; [L54] unsigned char last_1_var_1_5 = 1; [L55] unsigned long int last_1_var_1_12 = 128; [L56] unsigned char last_1_var_1_13 = 16; [L57] unsigned long int last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L182] last_1_var_1_1 = var_1_1 [L183] last_1_var_1_5 = var_1_5 [L184] last_1_var_1_12 = var_1_12 [L185] last_1_var_1_13 = var_1_13 [L186] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L133] var_1_6 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L134] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L135] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L135] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L136] var_1_8 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L138] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L138] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L139] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L139] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L140] var_1_9 = __VERIFIER_nondet_ulong() [L141] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L141] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L142] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L142] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L143] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L143] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L144] var_1_11 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L145] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L146] var_1_14 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L147] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L148] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L149] var_1_17 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L150] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L151] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L152] var_1_19 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L153] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L154] var_1_20 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L155] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L156] var_1_27 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L157] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L158] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L158] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L159] var_1_29 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L160] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L161] var_1_32 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L162] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L163] var_1_33 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L164] RET assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L165] var_1_35 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L166] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L167] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L167] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L168] var_1_36 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L169] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L170] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L170] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L171] var_1_39 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L172] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L173] CALL assume_abort_if_not(var_1_39 <= 15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L173] RET assume_abort_if_not(var_1_39 <= 15) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L174] var_1_40 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L175] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L176] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L177] var_1_41 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L178] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L179] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L179] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L197] RET updateVariables() [L198] CALL step() [L61] signed long int stepLocal_1 = last_1_var_1_13; [L62] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L63] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L64] COND TRUE \read(last_1_var_1_5) [L65] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L74] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L75] COND TRUE last_1_var_1_13 <= stepLocal_2 [L76] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L80] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L81] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L84] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L85] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L86] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L89] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L94] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L96] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L97] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L99] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L104] var_1_28 = var_1_29 [L105] var_1_30 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L106] COND FALSE !((((((var_1_32 - var_1_33)) < (var_1_29)) ? ((var_1_32 - var_1_33)) : (var_1_29))) > (var_1_7 * 31.3)) [L111] var_1_31 = (var_1_35 && ((var_1_13 > var_1_13) && (! var_1_36))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L113] COND TRUE (var_1_7 / 25.4f) >= ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) [L114] var_1_37 = (! (var_1_36 || var_1_35)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L116] COND TRUE ! var_1_5 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L117] EXPR (var_1_15 + var_1_13) << ((((5) < (var_1_39)) ? (5) : (var_1_39))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L117] COND FALSE !((var_1_13 + var_1_13) >= ((var_1_15 + var_1_13) << ((((5) < (var_1_39)) ? (5) : (var_1_39))))) [L124] COND FALSE !(! (var_1_1 >= var_1_41)) [L127] var_1_38 = 0 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L198] RET step() [L199] CALL, EXPR property() [L189-L190] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 8, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1065 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1052 mSDsluCounter, 3031 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2057 mSDsCounter, 629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1071 IncrementalHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 629 mSolverCounterUnsat, 974 mSDtfsCounter, 1071 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 589 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=4, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 322 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2110 NumberOfCodeBlocks, 2110 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1906 ConstructedInterpolants, 0 QuantifiedInterpolants, 6526 SizeOfPredicates, 3 NumberOfNonLiveVariables, 906 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 17189/17400 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-02-05 22:51:05,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:51:07,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:51:07,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:51:07,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:51:07,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:51:07,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:51:07,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:51:07,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:51:07,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:51:07,541 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:51:07,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:51:07,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:51:07,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:51:07,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:51:07,542 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:51:07,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:51:07,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:51:07,542 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:51:07,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:51:07,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:51:07,543 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:51:07,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:51:07,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:51:07,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:51:07,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:51:07,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:51:07,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:51:07,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:51:07,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:51:07,545 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:51:07,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:51:07,545 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:51:07,545 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:51:07,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:51:07,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:51:07,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:51:07,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:51:07,545 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-jdk21/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 -> 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb [2025-02-05 22:51:07,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:51:07,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:51:07,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:51:07,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:51:07,873 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:51:07,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2025-02-05 22:51:09,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d30629dcf/b1766cb25ba947f1907b08f30a97a77e/FLAGe64f231bf [2025-02-05 22:51:09,579 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:51:09,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2025-02-05 22:51:09,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d30629dcf/b1766cb25ba947f1907b08f30a97a77e/FLAGe64f231bf [2025-02-05 22:51:09,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d30629dcf/b1766cb25ba947f1907b08f30a97a77e [2025-02-05 22:51:09,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:51:09,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:51:09,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:51:09,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:51:09,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:51:09,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:51:09" (1/1) ... [2025-02-05 22:51:09,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2d7167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:09, skipping insertion in model container [2025-02-05 22:51:09,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:51:09" (1/1) ... [2025-02-05 22:51:09,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:51:10,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2025-02-05 22:51:10,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:51:10,179 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:51:10,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2025-02-05 22:51:10,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:51:10,245 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:51:10,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10 WrapperNode [2025-02-05 22:51:10,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:51:10,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:51:10,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:51:10,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:51:10,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,303 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-02-05 22:51:10,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:51:10,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:51:10,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:51:10,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:51:10,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,337 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-02-05 22:51:10,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:51:10,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:51:10,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:51:10,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:51:10,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (1/1) ... [2025-02-05 22:51:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:51:10,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:51:10,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:51:10,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:51:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:51:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:51:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:51:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:51:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:51:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:51:10,513 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:51:10,515 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:51:25,810 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:51:25,811 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:51:25,820 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:51:25,820 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:51:25,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:51:25 BoogieIcfgContainer [2025-02-05 22:51:25,821 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:51:25,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:51:25,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:51:25,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:51:25,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:51:09" (1/3) ... [2025-02-05 22:51:25,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2d95fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:51:25, skipping insertion in model container [2025-02-05 22:51:25,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:10" (2/3) ... [2025-02-05 22:51:25,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2d95fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:51:25, skipping insertion in model container [2025-02-05 22:51:25,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:51:25" (3/3) ... [2025-02-05 22:51:25,832 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2025-02-05 22:51:25,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:51:25,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:51:25,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:51:25,913 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;@2e546cb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:51:25,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:51:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:51:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 22:51:25,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:51:25,935 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:51:25,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:51:25,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:51:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1522477479, now seen corresponding path program 1 times [2025-02-05 22:51:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:51:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841985745] [2025-02-05 22:51:25,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:51:25,958 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-02-05 22:51:25,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:51:25,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 22:51:25,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:51:26,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 22:51:26,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 22:51:26,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:51:26,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:51:26,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:51:26,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:51:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2025-02-05 22:51:26,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:51:26,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:51:26,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841985745] [2025-02-05 22:51:26,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841985745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:51:26,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:51:26,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:51:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530561955] [2025-02-05 22:51:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:51:26,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:51:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:51:26,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:51:26,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:51:26,806 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:51:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:51:26,834 INFO L93 Difference]: Finished difference Result 168 states and 297 transitions. [2025-02-05 22:51:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:51:26,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 190 [2025-02-05 22:51:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:51:26,842 INFO L225 Difference]: With dead ends: 168 [2025-02-05 22:51:26,842 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 22:51:26,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 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-02-05 22:51:26,847 INFO L435 NwaCegarLoop]: 130 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, 130 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-02-05 22:51:26,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:51:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 22:51:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 22:51:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:51:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2025-02-05 22:51:26,896 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 190 [2025-02-05 22:51:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:51:26,896 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2025-02-05 22:51:26,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:51:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2025-02-05 22:51:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 22:51:26,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:51:26,906 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:51:26,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:51:27,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 22:51:27,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:51:27,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:51:27,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1876341211, now seen corresponding path program 1 times [2025-02-05 22:51:27,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:51:27,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404652511] [2025-02-05 22:51:27,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:51:27,108 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-02-05 22:51:27,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:51:27,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 22:51:27,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:51:27,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 22:51:27,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 22:51:27,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:51:27,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:51:27,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:51:27,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:51:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:51:30,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:51:30,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:51:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404652511] [2025-02-05 22:51:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404652511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:51:30,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:51:30,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:51:30,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570351916] [2025-02-05 22:51:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:51:30,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:51:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:51:30,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:51:30,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:51:30,176 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:51:32,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:51:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:51:33,092 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2025-02-05 22:51:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:51:33,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2025-02-05 22:51:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:51:33,122 INFO L225 Difference]: With dead ends: 165 [2025-02-05 22:51:33,122 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 22:51:33,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:51:33,126 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 111 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:51:33,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 184 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 72 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 22:51:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 22:51:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 22:51:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:51:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2025-02-05 22:51:33,148 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 190 [2025-02-05 22:51:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:51:33,152 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2025-02-05 22:51:33,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:51:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2025-02-05 22:51:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 22:51:33,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:51:33,157 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:51:33,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:51:33,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 22:51:33,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:51:33,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:51:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash 245369070, now seen corresponding path program 1 times [2025-02-05 22:51:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:51:33,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068024550] [2025-02-05 22:51:33,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:51:33,360 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-02-05 22:51:33,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:51:33,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 22:51:33,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:51:33,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:51:34,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:51:34,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:51:34,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:51:34,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 22:51:34,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:51:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-02-05 22:51:40,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:51:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:51:43,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:51:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068024550] [2025-02-05 22:51:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068024550] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:51:43,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:51:43,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2025-02-05 22:51:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597046478] [2025-02-05 22:51:43,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:51:43,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:51:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:51:43,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:51:43,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:51:43,213 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-02-05 22:51:47,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:51:51,926 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-02-05 22:51:55,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:52:00,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:52:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:52:01,128 INFO L93 Difference]: Finished difference Result 315 states and 480 transitions. [2025-02-05 22:52:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 22:52:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 191 [2025-02-05 22:52:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:52:01,132 INFO L225 Difference]: With dead ends: 315 [2025-02-05 22:52:01,132 INFO L226 Difference]: Without dead ends: 234 [2025-02-05 22:52:01,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-02-05 22:52:01,134 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 271 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 145 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:52:01,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 751 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 842 Invalid, 1 Unknown, 0 Unchecked, 16.8s Time] [2025-02-05 22:52:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-05 22:52:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 201. [2025-02-05 22:52:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 125 states have (on average 1.312) internal successors, (164), 126 states have internal predecessors, (164), 71 states have call successors, (71), 4 states have call predecessors, (71), 4 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 22:52:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 306 transitions. [2025-02-05 22:52:01,186 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 306 transitions. Word has length 191 [2025-02-05 22:52:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:52:01,187 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 306 transitions. [2025-02-05 22:52:01,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-02-05 22:52:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 306 transitions. [2025-02-05 22:52:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 22:52:01,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:01,190 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:52:01,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-02-05 22:52:01,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-05 22:52:01,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:01,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1535622275, now seen corresponding path program 1 times [2025-02-05 22:52:01,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:52:01,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889931171] [2025-02-05 22:52:01,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:01,395 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-02-05 22:52:01,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:52:01,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-05 22:52:01,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:52:01,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 22:52:02,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 22:52:02,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:02,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:02,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:52:02,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:52:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:52:05,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:52:05,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:52:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889931171] [2025-02-05 22:52:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889931171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:52:05,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:52:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:52:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108027728] [2025-02-05 22:52:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:52:05,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:52:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:52:05,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:52:05,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:52:05,273 INFO L87 Difference]: Start difference. First operand 201 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:52:08,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:52:10,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:52:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:52:10,538 INFO L93 Difference]: Finished difference Result 321 states and 489 transitions. [2025-02-05 22:52:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:52:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2025-02-05 22:52:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:52:10,569 INFO L225 Difference]: With dead ends: 321 [2025-02-05 22:52:10,569 INFO L226 Difference]: Without dead ends: 189 [2025-02-05 22:52:10,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:52:10,571 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 61 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:52:10,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 480 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 22:52:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-05 22:52:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-02-05 22:52:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 112 states have internal predecessors, (139), 71 states have call successors, (71), 4 states have call predecessors, (71), 4 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 22:52:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2025-02-05 22:52:10,611 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 192 [2025-02-05 22:52:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:52:10,612 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2025-02-05 22:52:10,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:52:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2025-02-05 22:52:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 22:52:10,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:10,614 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:52:10,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:52:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-05 22:52:10,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2113884391, now seen corresponding path program 1 times [2025-02-05 22:52:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:52:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326366031] [2025-02-05 22:52:10,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:10,815 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-02-05 22:52:10,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:52:10,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-05 22:52:10,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:52:10,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 22:52:11,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 22:52:11,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:11,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:11,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 22:52:11,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:52:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 143 proven. 84 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2025-02-05 22:52:13,183 INFO L312 TraceCheckSpWp]: Computing backward predicates...