./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba06880449cc9eb48584427dad875518cd896e20dec3ed5b33045e3e8689f7a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:23:36,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:23:36,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:23:36,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:23:36,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:23:36,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:23:36,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:23:36,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:23:36,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:23:36,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:23:36,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:23:36,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:23:36,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:23:36,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:23:36,751 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:23:36,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:23:36,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:23:36,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:23:36,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:23:36,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:23:36,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:23:36,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:23:36,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:23:36,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:23:36,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:23:36,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:23:36,752 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:23:36,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:23:36,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:23:36,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:36,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:23:36,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:23:36,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:23:36,754 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba06880449cc9eb48584427dad875518cd896e20dec3ed5b33045e3e8689f7a3 [2025-03-17 01:23:36,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:23:36,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:23:36,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:23:36,991 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:23:36,991 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:23:36,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-17 01:23:38,210 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfd9463e/007a183fbc8240be951aa4d1e0da2d2a/FLAG04daf00af [2025-03-17 01:23:38,456 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:23:38,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-17 01:23:38,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfd9463e/007a183fbc8240be951aa4d1e0da2d2a/FLAG04daf00af [2025-03-17 01:23:38,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfd9463e/007a183fbc8240be951aa4d1e0da2d2a [2025-03-17 01:23:38,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:23:38,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:23:38,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:38,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:23:38,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:23:38,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a63580c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38, skipping insertion in model container [2025-03-17 01:23:38,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:23:38,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i[918,931] [2025-03-17 01:23:38,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:23:38,718 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:23:38,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i[918,931] [2025-03-17 01:23:38,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:23:38,762 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:23:38,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38 WrapperNode [2025-03-17 01:23:38,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:38,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:23:38,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:23:38,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:23:38,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,811 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-17 01:23:38,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:23:38,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:23:38,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:23:38,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:23:38,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,845 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:23:38,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:23:38,870 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:23:38,870 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:23:38,870 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:23:38,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (1/1) ... [2025-03-17 01:23:38,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:38,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:38,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:23:38,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:23:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:23:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:23:38,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:23:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:23:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:23:38,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:23:38,987 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:23:38,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:23:39,317 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:23:39,317 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:23:39,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:23:39,329 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 01:23:39,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:39 BoogieIcfgContainer [2025-03-17 01:23:39,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:23:39,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:23:39,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:23:39,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:23:39,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:23:38" (1/3) ... [2025-03-17 01:23:39,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f65c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:23:39, skipping insertion in model container [2025-03-17 01:23:39,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:38" (2/3) ... [2025-03-17 01:23:39,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f65c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:23:39, skipping insertion in model container [2025-03-17 01:23:39,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:39" (3/3) ... [2025-03-17 01:23:39,342 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-17 01:23:39,357 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:23:39,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:23:39,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:23:39,410 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;@201301bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:23:39,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:23:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 47 states have internal predecessors, (70), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:23:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 01:23:39,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:39,423 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:39,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:39,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1294461677, now seen corresponding path program 1 times [2025-03-17 01:23:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:39,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183389955] [2025-03-17 01:23:39,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:39,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:23:39,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:23:39,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:39,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:23:39,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183389955] [2025-03-17 01:23:39,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183389955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:39,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967949493] [2025-03-17 01:23:39,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:39,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:39,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:39,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:23:39,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:23:39,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:23:39,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:23:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:39,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:23:39,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:23:39,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:39,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967949493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:39,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:23:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:23:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516278769] [2025-03-17 01:23:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:39,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:23:39,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:39,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:23:39,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:23:39,898 INFO L87 Difference]: Start difference. First operand has 68 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 47 states have internal predecessors, (70), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:23:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:39,922 INFO L93 Difference]: Finished difference Result 133 states and 233 transitions. [2025-03-17 01:23:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:23:39,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2025-03-17 01:23:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:39,931 INFO L225 Difference]: With dead ends: 133 [2025-03-17 01:23:39,931 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 01:23:39,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:23:39,937 INFO L435 NwaCegarLoop]: 102 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, 102 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-03-17 01:23:39,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:23:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 01:23:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 01:23:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:23:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 103 transitions. [2025-03-17 01:23:39,971 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 103 transitions. Word has length 128 [2025-03-17 01:23:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:39,972 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 103 transitions. [2025-03-17 01:23:39,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:23:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2025-03-17 01:23:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 01:23:39,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:39,974 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:39,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:23:40,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:23:40,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:40,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash 566811094, now seen corresponding path program 1 times [2025-03-17 01:23:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:40,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252407849] [2025-03-17 01:23:40,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:40,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:23:40,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:23:40,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:40,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:23:40,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:40,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252407849] [2025-03-17 01:23:40,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252407849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:40,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:40,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:23:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501436861] [2025-03-17 01:23:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:40,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:23:40,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:40,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:23:40,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:23:40,408 INFO L87 Difference]: Start difference. First operand 66 states and 103 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:23:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:40,461 INFO L93 Difference]: Finished difference Result 165 states and 253 transitions. [2025-03-17 01:23:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:23:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2025-03-17 01:23:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:40,464 INFO L225 Difference]: With dead ends: 165 [2025-03-17 01:23:40,464 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 01:23:40,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:23:40,465 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 47 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:40,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 230 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:23:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 01:23:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2025-03-17 01:23:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 63 states have internal predecessors, (83), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:23:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 147 transitions. [2025-03-17 01:23:40,476 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 147 transitions. Word has length 128 [2025-03-17 01:23:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:40,477 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 147 transitions. [2025-03-17 01:23:40,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:23:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 147 transitions. [2025-03-17 01:23:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 01:23:40,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:40,478 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:40,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:23:40,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:40,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1454314775, now seen corresponding path program 1 times [2025-03-17 01:23:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:40,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732264341] [2025-03-17 01:23:40,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:40,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:23:40,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:23:40,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:40,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:23:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732264341] [2025-03-17 01:23:41,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732264341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:41,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:41,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:23:41,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246985310] [2025-03-17 01:23:41,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:41,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:23:41,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:41,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:23:41,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:23:41,457 INFO L87 Difference]: Start difference. First operand 97 states and 147 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:23:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:41,862 INFO L93 Difference]: Finished difference Result 301 states and 456 transitions. [2025-03-17 01:23:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 01:23:41,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2025-03-17 01:23:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:41,865 INFO L225 Difference]: With dead ends: 301 [2025-03-17 01:23:41,866 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 01:23:41,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:23:41,868 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 284 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:41,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 345 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:23:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 01:23:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2025-03-17 01:23:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 99 states have internal predecessors, (133), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:23:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 235 transitions. [2025-03-17 01:23:41,905 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 235 transitions. Word has length 128 [2025-03-17 01:23:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:41,908 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 235 transitions. [2025-03-17 01:23:41,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:23:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 235 transitions. [2025-03-17 01:23:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 01:23:41,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:41,910 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:41,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:23:41,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1257801270, now seen corresponding path program 1 times [2025-03-17 01:23:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:41,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630805895] [2025-03-17 01:23:41,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:41,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:41,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:23:42,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:23:42,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:42,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:23:42,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862855209] [2025-03-17 01:23:42,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:42,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:42,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:42,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:23:42,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:23:42,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:23:42,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:23:42,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:42,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:23:42,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:23:42,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:23:42,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:23:42,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:42,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:23:42,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:23:42,560 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:23:42,561 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:23:42,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:23:42,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 01:23:42,765 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 01:23:42,842 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:23:42,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:23:42 BoogieIcfgContainer [2025-03-17 01:23:42,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:23:42,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:23:42,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:23:42,845 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:23:42,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:39" (3/4) ... [2025-03-17 01:23:42,848 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:23:42,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:23:42,849 INFO L158 Benchmark]: Toolchain (without parser) took 4361.26ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.2MB in the beginning and 138.6MB in the end (delta: -26.3MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2025-03-17 01:23:42,849 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:23:42,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.22ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 96.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:23:42,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:23:42,850 INFO L158 Benchmark]: Boogie Preprocessor took 54.45ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 85.1MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:23:42,850 INFO L158 Benchmark]: IcfgBuilder took 459.94ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 59.0MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:23:42,850 INFO L158 Benchmark]: TraceAbstraction took 3512.66ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 58.6MB in the beginning and 138.6MB in the end (delta: -80.0MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-03-17 01:23:42,850 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 176.2MB. Free memory was 138.6MB in the beginning and 138.6MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:23:42,852 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.22ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 96.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.45ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 85.1MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 459.94ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 59.0MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3512.66ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 58.6MB in the beginning and 138.6MB in the end (delta: -80.0MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 176.2MB. Free memory was 138.6MB in the beginning and 138.6MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 150. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 1; [L25] unsigned long int var_1_6 = 5; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 64; [L28] unsigned char var_1_11 = 64; [L29] unsigned short int var_1_12 = 25; [L30] unsigned short int var_1_14 = 31408; [L31] double var_1_15 = 64.375; [L32] double var_1_16 = 10.85; [L33] double var_1_17 = 128.8; [L34] double var_1_18 = 2.6; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed short int var_1_21 = -64; [L38] signed long int var_1_22 = -32; [L39] signed char var_1_26 = 25; [L40] signed char var_1_27 = 4; [L41] unsigned long int var_1_28 = 32; [L42] signed short int var_1_30 = 5; [L43] unsigned long int var_1_32 = 4; [L44] float var_1_34 = 31.25; [L45] double var_1_39 = 7.4; [L46] signed long int var_1_44 = 25; [L47] unsigned short int last_1_var_1_12 = 25; [L48] double last_1_var_1_15 = 64.375; [L170] isInitial = 1 [L171] FCALL initially() [L172] COND TRUE 1 [L173] CALL updateLastVariables() [L162] last_1_var_1_12 = var_1_12 [L163] last_1_var_1_15 = var_1_15 [L173] RET updateLastVariables() [L174] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L136] var_1_10 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L137] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L138] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L140] RET assume_abort_if_not(var_1_11 >= 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L141] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L142] var_1_14 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L143] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L144] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L145] var_1_16 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L146] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L147] var_1_17 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L148] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L150] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L151] var_1_20 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L153] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L154] var_1_26 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_26 >= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L155] RET assume_abort_if_not(var_1_26 >= 16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_26 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L156] RET assume_abort_if_not(var_1_26 <= 32) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L158] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_27 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L159] RET assume_abort_if_not(var_1_27 <= 16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L174] RET updateVariables() [L175] CALL step() [L52] COND FALSE !(last_1_var_1_12 > var_1_4) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L57] COND FALSE !(((- 64) + var_1_6) == var_1_6) [L60] var_1_1 = (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L62] COND TRUE var_1_17 == ((((32.5) < (var_1_15)) ? (32.5) : (var_1_15))) [L63] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L73] COND TRUE var_1_5 == (var_1_6 / var_1_4) [L74] var_1_9 = ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L78] COND FALSE !(-256 < (var_1_6 * 10)) [L83] var_1_39 = var_1_16 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L85] var_1_21 = var_1_10 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L86] COND TRUE 8.4 <= var_1_15 [L87] var_1_28 = (((((((var_1_5) < (var_1_1)) ? (var_1_5) : (var_1_1))) < 0 ) ? -((((var_1_5) < (var_1_1)) ? (var_1_5) : (var_1_1))) : ((((var_1_5) < (var_1_1)) ? (var_1_5) : (var_1_1))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L91] unsigned long int stepLocal_3 = var_1_6; [L92] unsigned char stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_2=128, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L93] COND FALSE !(stepLocal_2 < var_1_1) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L98] EXPR ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) >> (var_1_26 - var_1_27) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L98] COND FALSE !(var_1_4 <= (((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) >> (var_1_26 - var_1_27))) [L101] var_1_22 = var_1_4 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L103] unsigned long int stepLocal_0 = (((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_0=128, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L104] COND TRUE ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= stepLocal_0 [L105] var_1_12 = ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L109] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L112] var_1_44 = var_1_4 [L113] signed long int stepLocal_1 = ~ (var_1_5 * var_1_1); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_1=-1, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=128, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L114] COND TRUE stepLocal_1 <= var_1_12 [L115] var_1_15 = (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=128, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L119] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=128, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L175] RET step() [L176] CALL, EXPR property() [L166-L167] return (((((((((- 64) + var_1_6) == var_1_6) ? (var_1_1 == ((unsigned char) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - var_1_5))) : (var_1_1 == ((unsigned char) (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64)))) && ((last_1_var_1_12 > var_1_4) ? (((- last_1_var_1_15) < last_1_var_1_15) ? (var_1_6 == ((unsigned long int) 10u)) : 1) : 1)) && ((var_1_5 == (var_1_6 / var_1_4)) ? (var_1_9 == ((unsigned char) ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) : (var_1_9 == ((unsigned char) ((var_1_10 + var_1_11) - var_1_5))))) && ((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= ((((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)))) ? (var_1_12 == ((unsigned short int) ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_12 == ((unsigned short int) var_1_6)))) && (((~ (var_1_5 * var_1_1)) <= var_1_12) ? (var_1_15 == ((double) (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))))) : (var_1_15 == ((double) ((((((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) < (var_1_18)) ? (((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) : (var_1_18))))))) && ((var_1_4 < var_1_1) ? ((var_1_6 > var_1_21) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_21 == ((signed short int) var_1_10)) ; [L176] RET, EXPR property() [L176] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=128, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=-256, var_1_21=63, var_1_22=128, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=128, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 127 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 677 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 326 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 55 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 768 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 1532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2700/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 01:23:42,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba06880449cc9eb48584427dad875518cd896e20dec3ed5b33045e3e8689f7a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:23:44,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:23:44,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:23:44,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:23:44,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:23:44,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:23:44,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:23:44,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:23:44,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:23:44,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:23:44,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:23:44,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:23:44,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:23:44,936 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:23:44,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:44,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:23:44,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:23:44,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:23:44,938 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba06880449cc9eb48584427dad875518cd896e20dec3ed5b33045e3e8689f7a3 [2025-03-17 01:23:45,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:23:45,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:23:45,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:23:45,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:23:45,191 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:23:45,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-17 01:23:46,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8be549f/b9b63c0c2eee4e938a4a3c16b97d685b/FLAGd4273841d [2025-03-17 01:23:46,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:23:46,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-17 01:23:46,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8be549f/b9b63c0c2eee4e938a4a3c16b97d685b/FLAGd4273841d [2025-03-17 01:23:47,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8be549f/b9b63c0c2eee4e938a4a3c16b97d685b [2025-03-17 01:23:47,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:23:47,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:23:47,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:47,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:23:47,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:23:47,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a2e33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47, skipping insertion in model container [2025-03-17 01:23:47,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:23:47,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i[918,931] [2025-03-17 01:23:47,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:23:47,235 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:23:47,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i[918,931] [2025-03-17 01:23:47,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:23:47,289 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:23:47,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47 WrapperNode [2025-03-17 01:23:47,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:47,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:23:47,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:23:47,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:23:47,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,343 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2025-03-17 01:23:47,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:23:47,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:23:47,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:23:47,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:23:47,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,379 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:23:47,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:23:47,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:23:47,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:23:47,401 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:23:47,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (1/1) ... [2025-03-17 01:23:47,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:47,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:47,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:23:47,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:23:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:23:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:23:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:23:47,446 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:23:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:23:47,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:23:47,502 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:23:47,504 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:23:48,200 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:23:48,200 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:23:48,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:23:48,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:23:48,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:48 BoogieIcfgContainer [2025-03-17 01:23:48,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:23:48,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:23:48,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:23:48,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:23:48,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:23:47" (1/3) ... [2025-03-17 01:23:48,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a655ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:23:48, skipping insertion in model container [2025-03-17 01:23:48,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:47" (2/3) ... [2025-03-17 01:23:48,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a655ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:23:48, skipping insertion in model container [2025-03-17 01:23:48,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:48" (3/3) ... [2025-03-17 01:23:48,222 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-17 01:23:48,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:23:48,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:23:48,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:23:48,286 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;@26717294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:23:48,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:23:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 45 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:23:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:48,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:48,298 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:48,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:48,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1801995401, now seen corresponding path program 1 times [2025-03-17 01:23:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:48,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095431278] [2025-03-17 01:23:48,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:48,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:48,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:48,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:48,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 01:23:48,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:48,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:48,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:48,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:48,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:23:48,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:23:48,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:48,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:48,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095431278] [2025-03-17 01:23:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095431278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:48,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:48,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:23:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051003715] [2025-03-17 01:23:48,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:48,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:23:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:48,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:23:48,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:23:48,641 INFO L87 Difference]: Start difference. First operand has 66 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 45 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:23:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:48,664 INFO L93 Difference]: Finished difference Result 129 states and 227 transitions. [2025-03-17 01:23:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:23:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 127 [2025-03-17 01:23:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:48,672 INFO L225 Difference]: With dead ends: 129 [2025-03-17 01:23:48,672 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 01:23:48,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:23:48,678 INFO L435 NwaCegarLoop]: 100 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, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:48,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:23:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 01:23:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 01:23:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:23:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2025-03-17 01:23:48,714 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 127 [2025-03-17 01:23:48,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:48,714 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2025-03-17 01:23:48,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:23:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2025-03-17 01:23:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:48,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:48,716 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:48,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 01:23:48,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:48,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:48,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash 726416773, now seen corresponding path program 1 times [2025-03-17 01:23:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279706761] [2025-03-17 01:23:48,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:48,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:48,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:48,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:48,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 01:23:48,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:49,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:49,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:49,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:49,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:23:49,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-17 01:23:49,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:23:49,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279706761] [2025-03-17 01:23:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279706761] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:23:49,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:23:49,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 01:23:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356052940] [2025-03-17 01:23:49,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:49,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:23:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:49,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:23:49,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:23:49,563 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 01:23:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:50,287 INFO L93 Difference]: Finished difference Result 133 states and 202 transitions. [2025-03-17 01:23:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:23:50,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 127 [2025-03-17 01:23:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:50,298 INFO L225 Difference]: With dead ends: 133 [2025-03-17 01:23:50,298 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 01:23:50,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:23:50,299 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 88 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:50,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 168 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:23:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 01:23:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-03-17 01:23:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:23:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2025-03-17 01:23:50,319 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 127 [2025-03-17 01:23:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:50,320 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2025-03-17 01:23:50,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 01:23:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2025-03-17 01:23:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:50,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:50,321 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:50,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 01:23:50,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:50,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1613920454, now seen corresponding path program 1 times [2025-03-17 01:23:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:50,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124587780] [2025-03-17 01:23:50,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:50,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:50,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:50,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:50,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 01:23:50,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:50,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:50,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:50,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:50,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 01:23:50,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:51,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:51,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:51,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124587780] [2025-03-17 01:23:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124587780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:51,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1804986556] [2025-03-17 01:23:51,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:51,591 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:51,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:23:51,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:23:51,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-17 01:23:51,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:52,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:52,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:52,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:52,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:23:52,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:53,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1804986556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:53,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:23:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-17 01:23:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934171126] [2025-03-17 01:23:53,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:53,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:23:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:53,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:23:53,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:23:53,220 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:23:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:54,200 INFO L93 Difference]: Finished difference Result 203 states and 294 transitions. [2025-03-17 01:23:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:23:54,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2025-03-17 01:23:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:54,203 INFO L225 Difference]: With dead ends: 203 [2025-03-17 01:23:54,203 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 01:23:54,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:23:54,204 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 53 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:54,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 220 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:23:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 01:23:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2025-03-17 01:23:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 01:23:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 191 transitions. [2025-03-17 01:23:54,221 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 191 transitions. Word has length 127 [2025-03-17 01:23:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:54,221 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 191 transitions. [2025-03-17 01:23:54,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:23:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 191 transitions. [2025-03-17 01:23:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:54,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:54,222 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:54,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 01:23:54,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-17 01:23:54,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:54,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:54,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1417406949, now seen corresponding path program 1 times [2025-03-17 01:23:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913727275] [2025-03-17 01:23:54,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:54,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:54,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:54,626 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:54,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 01:23:54,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:54,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:54,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:54,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 01:23:54,843 INFO L279 TraceCheckSpWp]: Computing forward predicates...