./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3df77670afa39ace423f8f8369d847156a56fccf6b4e9eb57830fd07cb1fc0f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:33:26,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:33:26,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:33:26,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:33:26,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:33:26,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:33:26,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:33:26,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:33:26,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:33:26,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:33:26,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:33:26,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:33:26,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:33:26,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:33:26,666 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:33:26,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:33:26,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:33:26,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:33:26,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:33:26,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:33:26,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:33:26,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:33:26,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:33:26,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:33:26,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:33:26,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:33:26,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:33:26,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3df77670afa39ace423f8f8369d847156a56fccf6b4e9eb57830fd07cb1fc0f9 [2025-02-05 23:33:26,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:33:26,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:33:26,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:33:26,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:33:26,933 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:33:26,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-02-05 23:33:28,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a029d4284/b1f751bbb5504770bd677a200a7a8d8b/FLAGbd88b70a7 [2025-02-05 23:33:28,425 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:33:28,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-02-05 23:33:28,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a029d4284/b1f751bbb5504770bd677a200a7a8d8b/FLAGbd88b70a7 [2025-02-05 23:33:28,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a029d4284/b1f751bbb5504770bd677a200a7a8d8b [2025-02-05 23:33:28,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:33:28,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:33:28,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:33:28,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:33:28,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:33:28,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a00cf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28, skipping insertion in model container [2025-02-05 23:33:28,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:33:28,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i[919,932] [2025-02-05 23:33:28,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:33:28,662 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:33:28,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i[919,932] [2025-02-05 23:33:28,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:33:28,713 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:33:28,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28 WrapperNode [2025-02-05 23:33:28,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:33:28,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:33:28,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:33:28,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:33:28,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,761 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2025-02-05 23:33:28,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:33:28,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:33:28,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:33:28,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:33:28,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,801 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:33:28,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:33:28,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:33:28,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:33:28,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:33:28,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (1/1) ... [2025-02-05 23:33:28,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:33:28,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:33:28,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:33:28,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:33:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:33:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:33:28,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:33:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:33:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:33:28,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:33:28,958 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:33:28,961 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:33:29,335 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 23:33:29,336 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:33:29,354 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:33:29,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:33:29,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:29 BoogieIcfgContainer [2025-02-05 23:33:29,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:33:29,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:33:29,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:33:29,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:33:29,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:33:28" (1/3) ... [2025-02-05 23:33:29,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd4ef88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:29, skipping insertion in model container [2025-02-05 23:33:29,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:28" (2/3) ... [2025-02-05 23:33:29,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd4ef88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:29, skipping insertion in model container [2025-02-05 23:33:29,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:29" (3/3) ... [2025-02-05 23:33:29,361 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-02-05 23:33:29,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:33:29,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:33:29,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:33:29,436 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;@5e64a50f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:33:29,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:33:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 23:33:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 23:33:29,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:29,454 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:29,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:29,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1666625040, now seen corresponding path program 1 times [2025-02-05 23:33:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165434037] [2025-02-05 23:33:29,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:29,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:29,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 23:33:29,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 23:33:29,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:29,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 23:33:29,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:29,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165434037] [2025-02-05 23:33:29,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165434037] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:33:29,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285209397] [2025-02-05 23:33:29,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:29,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:33:29,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:33:29,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:33:29,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:33:29,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 23:33:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 23:33:29,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:29,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:33:29,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:33:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 23:33:29,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:33:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285209397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:29,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:33:29,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:33:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901540639] [2025-02-05 23:33:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:30,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:33:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:30,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:33:30,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:33:30,026 INFO L87 Difference]: Start difference. First operand has 96 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 23:33:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:30,053 INFO L93 Difference]: Finished difference Result 186 states and 327 transitions. [2025-02-05 23:33:30,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:33:30,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2025-02-05 23:33:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:30,062 INFO L225 Difference]: With dead ends: 186 [2025-02-05 23:33:30,062 INFO L226 Difference]: Without dead ends: 93 [2025-02-05 23:33:30,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:33:30,069 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:30,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:33:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-05 23:33:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-05 23:33:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 23:33:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 145 transitions. [2025-02-05 23:33:30,114 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 145 transitions. Word has length 175 [2025-02-05 23:33:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:30,114 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 145 transitions. [2025-02-05 23:33:30,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 23:33:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 145 transitions. [2025-02-05 23:33:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 23:33:30,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:30,117 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:30,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 23:33:30,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:33:30,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1329625618, now seen corresponding path program 1 times [2025-02-05 23:33:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593684179] [2025-02-05 23:33:30,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:30,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 23:33:30,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 23:33:30,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:30,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:33:30,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:30,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593684179] [2025-02-05 23:33:30,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593684179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:30,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:30,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:33:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373877752] [2025-02-05 23:33:30,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:30,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:33:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:30,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:33:30,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:30,606 INFO L87 Difference]: Start difference. First operand 93 states and 145 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:30,686 INFO L93 Difference]: Finished difference Result 264 states and 418 transitions. [2025-02-05 23:33:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:33:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-02-05 23:33:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:30,689 INFO L225 Difference]: With dead ends: 264 [2025-02-05 23:33:30,689 INFO L226 Difference]: Without dead ends: 174 [2025-02-05 23:33:30,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:30,691 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 80 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:30,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 260 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:33:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-05 23:33:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2025-02-05 23:33:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:33:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 227 transitions. [2025-02-05 23:33:30,740 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 227 transitions. Word has length 175 [2025-02-05 23:33:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:30,741 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 227 transitions. [2025-02-05 23:33:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 227 transitions. [2025-02-05 23:33:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 23:33:30,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:30,743 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:30,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:33:30,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1118274705, now seen corresponding path program 1 times [2025-02-05 23:33:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:30,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805434535] [2025-02-05 23:33:30,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:30,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 23:33:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 23:33:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:33:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:30,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805434535] [2025-02-05 23:33:30,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805434535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:30,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:33:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6849072] [2025-02-05 23:33:30,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:30,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:33:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:30,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:33:30,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:30,857 INFO L87 Difference]: Start difference. First operand 146 states and 227 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:30,903 INFO L93 Difference]: Finished difference Result 278 states and 426 transitions. [2025-02-05 23:33:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:33:30,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-02-05 23:33:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:30,907 INFO L225 Difference]: With dead ends: 278 [2025-02-05 23:33:30,907 INFO L226 Difference]: Without dead ends: 188 [2025-02-05 23:33:30,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:30,908 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 57 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:30,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 285 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:33:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-05 23:33:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2025-02-05 23:33:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 119 states have internal predecessors, (157), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 23:33:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 281 transitions. [2025-02-05 23:33:30,931 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 281 transitions. Word has length 175 [2025-02-05 23:33:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:30,932 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 281 transitions. [2025-02-05 23:33:30,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 281 transitions. [2025-02-05 23:33:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 23:33:30,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:30,935 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:30,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:33:30,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:30,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1623833330, now seen corresponding path program 1 times [2025-02-05 23:33:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686258100] [2025-02-05 23:33:30,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:30,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:30,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 23:33:30,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 23:33:30,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:33:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686258100] [2025-02-05 23:33:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686258100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:33:31,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629824749] [2025-02-05 23:33:31,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:31,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:33:31,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:31,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:33:31,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:31,096 INFO L87 Difference]: Start difference. First operand 185 states and 281 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:31,189 INFO L93 Difference]: Finished difference Result 374 states and 574 transitions. [2025-02-05 23:33:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:33:31,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-02-05 23:33:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:31,193 INFO L225 Difference]: With dead ends: 374 [2025-02-05 23:33:31,193 INFO L226 Difference]: Without dead ends: 249 [2025-02-05 23:33:31,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:31,197 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:31,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 282 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:33:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-05 23:33:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2025-02-05 23:33:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 162 states have (on average 1.4135802469135803) internal successors, (229), 163 states have internal predecessors, (229), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 23:33:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 353 transitions. [2025-02-05 23:33:31,240 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 353 transitions. Word has length 175 [2025-02-05 23:33:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:31,240 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 353 transitions. [2025-02-05 23:33:31,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 353 transitions. [2025-02-05 23:33:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 23:33:31,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:31,245 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:31,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:33:31,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:31,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash -13654181, now seen corresponding path program 1 times [2025-02-05 23:33:31,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:31,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790667778] [2025-02-05 23:33:31,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:31,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 23:33:31,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 23:33:31,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:31,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:33:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790667778] [2025-02-05 23:33:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790667778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:31,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:33:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732691661] [2025-02-05 23:33:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:31,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:33:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:31,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:33:31,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:31,625 INFO L87 Difference]: Start difference. First operand 229 states and 353 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:31,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:31,708 INFO L93 Difference]: Finished difference Result 450 states and 702 transitions. [2025-02-05 23:33:31,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:33:31,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-02-05 23:33:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:31,714 INFO L225 Difference]: With dead ends: 450 [2025-02-05 23:33:31,714 INFO L226 Difference]: Without dead ends: 285 [2025-02-05 23:33:31,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:31,718 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 72 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:31,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 256 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:33:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-05 23:33:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 231. [2025-02-05 23:33:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 164 states have (on average 1.4085365853658536) internal successors, (231), 165 states have internal predecessors, (231), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 23:33:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 355 transitions. [2025-02-05 23:33:31,743 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 355 transitions. Word has length 176 [2025-02-05 23:33:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:31,744 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 355 transitions. [2025-02-05 23:33:31,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 355 transitions. [2025-02-05 23:33:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 23:33:31,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:31,745 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:31,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:33:31,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash -819012792, now seen corresponding path program 1 times [2025-02-05 23:33:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443966493] [2025-02-05 23:33:31,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:31,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 23:33:31,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 23:33:31,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:31,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:33:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:31,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443966493] [2025-02-05 23:33:31,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443966493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:31,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:31,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:33:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025389741] [2025-02-05 23:33:31,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:31,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:33:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:31,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:33:31,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:33:31,907 INFO L87 Difference]: Start difference. First operand 231 states and 355 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:32,005 INFO L93 Difference]: Finished difference Result 569 states and 885 transitions. [2025-02-05 23:33:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:33:32,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-02-05 23:33:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:32,009 INFO L225 Difference]: With dead ends: 569 [2025-02-05 23:33:32,009 INFO L226 Difference]: Without dead ends: 404 [2025-02-05 23:33:32,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:33:32,010 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 100 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:32,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 383 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:33:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-05 23:33:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2025-02-05 23:33:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 291 states have (on average 1.436426116838488) internal successors, (418), 293 states have internal predecessors, (418), 98 states have call successors, (98), 6 states have call predecessors, (98), 6 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-05 23:33:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 614 transitions. [2025-02-05 23:33:32,071 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 614 transitions. Word has length 177 [2025-02-05 23:33:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:32,071 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 614 transitions. [2025-02-05 23:33:32,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 614 transitions. [2025-02-05 23:33:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 23:33:32,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:32,073 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:32,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:33:32,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:32,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1098903943, now seen corresponding path program 1 times [2025-02-05 23:33:32,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:32,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066015135] [2025-02-05 23:33:32,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:32,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:32,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 23:33:32,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 23:33:32,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:32,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:33:32,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:32,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066015135] [2025-02-05 23:33:32,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066015135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:32,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:32,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:33:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341311231] [2025-02-05 23:33:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:32,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:33:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:32,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:33:32,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:32,275 INFO L87 Difference]: Start difference. First operand 396 states and 614 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:32,364 INFO L93 Difference]: Finished difference Result 780 states and 1218 transitions. [2025-02-05 23:33:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:33:32,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-02-05 23:33:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:32,369 INFO L225 Difference]: With dead ends: 780 [2025-02-05 23:33:32,372 INFO L226 Difference]: Without dead ends: 450 [2025-02-05 23:33:32,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:32,374 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 70 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:32,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 257 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:33:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-05 23:33:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 398. [2025-02-05 23:33:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 293 states have (on average 1.4334470989761092) internal successors, (420), 295 states have internal predecessors, (420), 98 states have call successors, (98), 6 states have call predecessors, (98), 6 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-05 23:33:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 616 transitions. [2025-02-05 23:33:32,433 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 616 transitions. Word has length 178 [2025-02-05 23:33:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:32,433 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 616 transitions. [2025-02-05 23:33:32,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:33:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 616 transitions. [2025-02-05 23:33:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 23:33:32,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:32,450 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:32,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:33:32,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1225024319, now seen corresponding path program 1 times [2025-02-05 23:33:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135090895] [2025-02-05 23:33:32,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:32,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 23:33:32,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 23:33:32,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:32,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:33:32,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585170773] [2025-02-05 23:33:32,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:32,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:33:32,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:33:32,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:33:32,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 23:33:32,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 23:33:32,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 23:33:32,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:32,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:33:32,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 23:33:32,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 23:33:32,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 23:33:32,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:32,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:33:33,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 23:33:33,022 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 23:33:33,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 23:33:33,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 23:33:33,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:33:33,231 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:33,343 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 23:33:33,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:33:33 BoogieIcfgContainer [2025-02-05 23:33:33,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 23:33:33,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 23:33:33,349 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 23:33:33,350 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 23:33:33,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:29" (3/4) ... [2025-02-05 23:33:33,352 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 23:33:33,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 23:33:33,354 INFO L158 Benchmark]: Toolchain (without parser) took 4902.51ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 128.2MB in the beginning and 105.1MB in the end (delta: 23.1MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2025-02-05 23:33:33,354 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 192.9MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:33:33,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.81ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 112.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 23:33:33,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.71ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 107.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:33:33,355 INFO L158 Benchmark]: Boogie Preprocessor took 71.22ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 102.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 23:33:33,355 INFO L158 Benchmark]: IcfgBuilder took 520.42ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 71.8MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 23:33:33,355 INFO L158 Benchmark]: TraceAbstraction took 3990.03ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 71.5MB in the beginning and 105.1MB in the end (delta: -33.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-02-05 23:33:33,355 INFO L158 Benchmark]: Witness Printer took 5.81ms. Allocated memory is still 209.7MB. Free memory was 105.1MB in the beginning and 105.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:33:33,357 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.98ms. Allocated memory is still 192.9MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.81ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 112.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.71ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 107.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.22ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 102.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 520.42ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 71.8MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3990.03ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 71.5MB in the beginning and 105.1MB in the end (delta: -33.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Witness Printer took 5.81ms. Allocated memory is still 209.7MB. Free memory was 105.1MB in the beginning and 105.1MB in the end (delta: 33.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 someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of bitwiseAnd at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 256; [L23] unsigned short int var_1_2 = 51640; [L24] unsigned short int var_1_3 = 5; [L25] float var_1_7 = 128.8; [L26] unsigned char var_1_8 = 2; [L27] float var_1_9 = 256.5; [L28] float var_1_10 = 7.25; [L29] signed char var_1_11 = 64; [L30] signed char var_1_12 = -16; [L31] double var_1_13 = 0.9; [L32] unsigned char var_1_14 = 1; [L33] double var_1_15 = 0.0; [L34] double var_1_16 = 1.275; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 35331; [L37] signed char var_1_19 = -128; [L38] double var_1_20 = 0.0; [L39] double var_1_21 = 0.0; [L40] signed char var_1_22 = -8; [L41] signed char var_1_23 = 50; [L42] signed long int var_1_27 = 32; [L43] unsigned char var_1_28 = 64; [L44] signed char var_1_29 = 100; [L45] signed char var_1_30 = -1; [L46] signed char var_1_31 = 10; [L47] signed char var_1_32 = 5; [L48] signed char var_1_33 = 1; [L49] unsigned short int var_1_34 = 32; [L50] signed long int var_1_36 = -8; [L51] float last_1_var_1_10 = 7.25; [L52] double last_1_var_1_13 = 0.9; [L53] unsigned short int last_1_var_1_17 = 8; [L54] signed char last_1_var_1_19 = -128; VAL [isInitial=0, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L176] last_1_var_1_10 = var_1_10 [L177] last_1_var_1_13 = var_1_13 [L178] last_1_var_1_17 = var_1_17 [L179] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L134] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L135] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L135] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L136] var_1_3 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L139] var_1_8 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L140] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L141] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L141] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L142] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=513/2] [L142] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=513/2] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L144] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L145] var_1_12 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L146] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L147] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L147] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L150] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L150] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L151] var_1_15 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L152] RET assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L153] var_1_16 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L154] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L155] var_1_18 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_18 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L156] RET assume_abort_if_not(var_1_18 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L157] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L157] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L158] var_1_20 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L159] RET assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L160] var_1_21 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L161] RET assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L162] var_1_22 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L163] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L164] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L164] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L165] var_1_30 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L166] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L167] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L167] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L168] var_1_31 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L169] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L170] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L170] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L171] var_1_33 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L172] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L173] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L173] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L190] RET updateVariables() [L191] CALL step() [L58] COND TRUE (~ (- var_1_3)) < var_1_2 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L59] COND FALSE !(var_1_2 < -64) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L63] COND TRUE var_1_8 > var_1_19 [L64] var_1_27 = ((((var_1_8) > (var_1_22)) ? (var_1_8) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L66] COND TRUE var_1_17 <= (((((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) < 0 ) ? -((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) : ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) [L67] var_1_28 = 4 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L69] COND TRUE var_1_12 <= 16 [L70] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_31) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L72] COND FALSE !(var_1_11 >= var_1_1) [L75] var_1_32 = var_1_22 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L77] EXPR var_1_17 & var_1_11 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L77] EXPR (var_1_17 & var_1_11) ^ var_1_12 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L77] EXPR var_1_19 & var_1_33 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L77] COND FALSE !(((var_1_17 & var_1_11) ^ var_1_12) < (var_1_19 & var_1_33)) [L82] EXPR var_1_3 & (~ var_1_17) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L82] COND TRUE (var_1_3 & (~ var_1_17)) <= var_1_3 [L83] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L91] signed long int stepLocal_2 = var_1_3 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L92] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L103] COND TRUE var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16)) [L104] var_1_19 = ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=97, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L108] var_1_17 = (var_1_18 - var_1_3) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L109] COND TRUE (var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10) [L110] var_1_10 = var_1_9 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L112] COND FALSE !(var_1_10 >= var_1_10) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L117] COND TRUE (var_1_2 - var_1_3) > var_1_17 [L118] var_1_1 = (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L122] signed long int stepLocal_1 = var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))); [L123] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_1=32, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L124] COND FALSE !((var_1_19 / var_1_8) < stepLocal_1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return ((((((((var_1_2 - var_1_3) > var_1_17) ? (var_1_1 == ((signed long int) (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))))) : (var_1_1 == ((signed long int) 0))) && (((var_1_19 / var_1_8) < (var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))))) ? ((var_1_1 >= var_1_3) ? (var_1_7 == ((float) 0.75f)) : (var_1_7 == ((float) var_1_9))) : 1)) && (((var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10)) ? (var_1_10 == ((float) var_1_9)) : 1)) && ((var_1_10 >= var_1_10) ? ((var_1_9 < var_1_10) ? (var_1_11 == ((signed char) var_1_12)) : 1) : 1)) && (var_1_14 ? ((last_1_var_1_13 <= var_1_9) ? (var_1_13 == ((double) var_1_9)) : ((((((last_1_var_1_17) < ((var_1_2 * last_1_var_1_17))) ? (last_1_var_1_17) : ((var_1_2 * last_1_var_1_17)))) == (var_1_3 + last_1_var_1_19)) ? (var_1_13 == ((double) 8.75)) : (var_1_13 == ((double) (16.5 + ((var_1_15 - 49.35) - var_1_16)))))) : 1)) && (var_1_17 == ((unsigned short int) (var_1_18 - var_1_3)))) && ((var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16))) ? (var_1_19 == ((signed char) ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))))) : (var_1_19 == ((signed char) var_1_12))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 429 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 1864 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 869 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 995 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=7, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 165 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1762 NumberOfCodeBlocks, 1762 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1398 ConstructedInterpolants, 0 QuantifiedInterpolants, 3704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 10350/10400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 23:33:33,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3df77670afa39ace423f8f8369d847156a56fccf6b4e9eb57830fd07cb1fc0f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:33:35,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:33:35,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 23:33:35,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:33:35,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:33:35,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:33:35,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:33:35,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:33:35,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:33:35,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:33:35,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:33:35,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:33:35,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:33:35,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 23:33:35,905 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:33:35,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:33:35,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:33:35,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:33:35,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:33:35,907 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 23:33:35,907 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 23:33:35,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:33:35,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:33:35,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:33:35,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:33:35,907 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3df77670afa39ace423f8f8369d847156a56fccf6b4e9eb57830fd07cb1fc0f9 [2025-02-05 23:33:36,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:33:36,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:33:36,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:33:36,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:33:36,222 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:33:36,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-02-05 23:33:37,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8c901c9/63945e63d3034010886c3f22f7e6221f/FLAG7297db8aa [2025-02-05 23:33:37,863 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:33:37,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-02-05 23:33:37,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8c901c9/63945e63d3034010886c3f22f7e6221f/FLAG7297db8aa [2025-02-05 23:33:37,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8c901c9/63945e63d3034010886c3f22f7e6221f [2025-02-05 23:33:37,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:33:37,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:33:37,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:33:37,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:33:37,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:33:37,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:37" (1/1) ... [2025-02-05 23:33:37,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27439fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:37, skipping insertion in model container [2025-02-05 23:33:37,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:37" (1/1) ... [2025-02-05 23:33:37,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:33:38,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i[919,932] [2025-02-05 23:33:38,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:33:38,102 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:33:38,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i[919,932] [2025-02-05 23:33:38,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:33:38,173 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:33:38,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38 WrapperNode [2025-02-05 23:33:38,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:33:38,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:33:38,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:33:38,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:33:38,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,229 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-02-05 23:33:38,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:33:38,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:33:38,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:33:38,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:33:38,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,267 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:33:38,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:33:38,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:33:38,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:33:38,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:33:38,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (1/1) ... [2025-02-05 23:33:38,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:33:38,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:33:38,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:33:38,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:33:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:33:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 23:33:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:33:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:33:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:33:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:33:38,457 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:33:38,460 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:33:51,786 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 23:33:51,786 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:33:51,799 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:33:51,800 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:33:51,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:51 BoogieIcfgContainer [2025-02-05 23:33:51,800 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:33:51,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:33:51,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:33:51,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:33:51,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:33:37" (1/3) ... [2025-02-05 23:33:51,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4680cb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:51, skipping insertion in model container [2025-02-05 23:33:51,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:38" (2/3) ... [2025-02-05 23:33:51,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4680cb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:51, skipping insertion in model container [2025-02-05 23:33:51,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:51" (3/3) ... [2025-02-05 23:33:51,819 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-02-05 23:33:51,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:33:51,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:33:51,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:33:51,890 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;@238424e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:33:51,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:33:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 23:33:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 23:33:51,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:51,901 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:51,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:51,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1484212771, now seen corresponding path program 1 times [2025-02-05 23:33:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:33:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697981737] [2025-02-05 23:33:51,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:51,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:33:51,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:33:51,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:33:51,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 23:33:52,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 23:33:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 23:33:52,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:52,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:52,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:33:52,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:33:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-02-05 23:33:52,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:33:52,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:33:52,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697981737] [2025-02-05 23:33:52,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697981737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:52,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:52,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:33:52,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425863228] [2025-02-05 23:33:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:52,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:33:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:33:52,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:33:52,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:33:52,581 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 23:33:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:52,605 INFO L93 Difference]: Finished difference Result 159 states and 281 transitions. [2025-02-05 23:33:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:33:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-02-05 23:33:52,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:52,614 INFO L225 Difference]: With dead ends: 159 [2025-02-05 23:33:52,614 INFO L226 Difference]: Without dead ends: 79 [2025-02-05 23:33:52,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:33:52,621 INFO L435 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:52,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:33:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-05 23:33:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-05 23:33:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 23:33:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2025-02-05 23:33:52,657 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 171 [2025-02-05 23:33:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:52,657 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2025-02-05 23:33:52,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 23:33:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2025-02-05 23:33:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 23:33:52,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:52,659 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:52,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 23:33:52,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:33:52,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:52,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash 577018075, now seen corresponding path program 1 times [2025-02-05 23:33:52,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:33:52,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903880730] [2025-02-05 23:33:52,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:52,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:33:52,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:33:52,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:33:52,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 23:33:52,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 23:33:53,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 23:33:53,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:53,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:53,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 23:33:53,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:33:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:33:57,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:33:57,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:33:57,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903880730] [2025-02-05 23:33:57,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903880730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:57,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:57,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:33:57,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036039191] [2025-02-05 23:33:57,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:57,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:33:57,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:33:57,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:33:57,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:33:57,221 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:01,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:01,506 INFO L93 Difference]: Finished difference Result 222 states and 346 transitions. [2025-02-05 23:34:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:34:01,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-02-05 23:34:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:01,508 INFO L225 Difference]: With dead ends: 222 [2025-02-05 23:34:01,508 INFO L226 Difference]: Without dead ends: 146 [2025-02-05 23:34:01,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:01,509 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 27 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:01,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 224 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 23:34:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-05 23:34:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2025-02-05 23:34:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:34:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-02-05 23:34:01,530 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 171 [2025-02-05 23:34:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:01,530 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-02-05 23:34:01,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-02-05 23:34:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 23:34:01,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:01,534 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:01,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 23:34:01,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:34:01,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:01,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1930327772, now seen corresponding path program 1 times [2025-02-05 23:34:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:34:01,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136291667] [2025-02-05 23:34:01,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:01,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:34:01,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:34:01,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:34:01,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 23:34:01,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 23:34:02,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 23:34:02,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:02,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:02,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 23:34:02,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:34:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:02,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:34:02,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:34:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136291667] [2025-02-05 23:34:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136291667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:34:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115419311] [2025-02-05 23:34:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:34:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:34:02,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:34:02,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:02,481 INFO L87 Difference]: Start difference. First operand 132 states and 203 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:06,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:10,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:10,730 INFO L93 Difference]: Finished difference Result 250 states and 378 transitions. [2025-02-05 23:34:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:34:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-02-05 23:34:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:10,791 INFO L225 Difference]: With dead ends: 250 [2025-02-05 23:34:10,792 INFO L226 Difference]: Without dead ends: 174 [2025-02-05 23:34:10,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:10,793 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 57 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:10,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 246 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-05 23:34:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-05 23:34:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-02-05 23:34:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 105 states have internal predecessors, (133), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 23:34:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2025-02-05 23:34:10,810 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 171 [2025-02-05 23:34:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:10,810 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2025-02-05 23:34:10,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2025-02-05 23:34:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 23:34:10,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:10,812 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:10,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 23:34:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:34:11,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:11,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1424769147, now seen corresponding path program 1 times [2025-02-05 23:34:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:34:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351173690] [2025-02-05 23:34:11,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:11,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:34:11,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:34:11,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:34:11,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 23:34:11,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 23:34:11,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 23:34:11,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:11,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:11,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 23:34:11,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:34:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 576 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-05 23:34:19,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:34:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-05 23:34:20,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:34:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351173690] [2025-02-05 23:34:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351173690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:34:20,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:34:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-05 23:34:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312063795] [2025-02-05 23:34:20,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 23:34:20,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:34:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:34:20,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:34:20,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:34:20,946 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-02-05 23:34:26,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:29,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:31,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:35,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:39,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:44,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:44,013 INFO L93 Difference]: Finished difference Result 302 states and 443 transitions. [2025-02-05 23:34:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:34:44,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 171 [2025-02-05 23:34:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:44,085 INFO L225 Difference]: With dead ends: 302 [2025-02-05 23:34:44,085 INFO L226 Difference]: Without dead ends: 191 [2025-02-05 23:34:44,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:34:44,086 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 313 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 193 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:44,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 179 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 176 Invalid, 3 Unknown, 0 Unchecked, 21.9s Time] [2025-02-05 23:34:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-05 23:34:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2025-02-05 23:34:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.238938053097345) internal successors, (140), 114 states have internal predecessors, (140), 62 states have call successors, (62), 7 states have call predecessors, (62), 7 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 23:34:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2025-02-05 23:34:44,111 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 264 transitions. Word has length 171 [2025-02-05 23:34:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:44,112 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 264 transitions. [2025-02-05 23:34:44,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-02-05 23:34:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 264 transitions. [2025-02-05 23:34:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 23:34:44,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:44,115 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:44,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-02-05 23:34:44,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:34:44,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:44,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1158800405, now seen corresponding path program 1 times [2025-02-05 23:34:44,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:34:44,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934240015] [2025-02-05 23:34:44,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:44,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:34:44,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:34:44,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:34:44,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-05 23:34:44,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 23:34:44,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 23:34:44,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:44,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:44,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 23:34:44,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:34:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:44,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:34:44,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:34:44,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934240015] [2025-02-05 23:34:44,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934240015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:44,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:34:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766745114] [2025-02-05 23:34:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:44,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:34:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:34:44,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:34:44,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:44,820 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:49,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:34:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:49,289 INFO L93 Difference]: Finished difference Result 310 states and 443 transitions. [2025-02-05 23:34:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:34:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-02-05 23:34:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:49,293 INFO L225 Difference]: With dead ends: 310 [2025-02-05 23:34:49,293 INFO L226 Difference]: Without dead ends: 191 [2025-02-05 23:34:49,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:49,294 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 35 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:49,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 233 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-05 23:34:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-05 23:34:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-05 23:34:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 119 states have (on average 1.2100840336134453) internal successors, (144), 120 states have internal predecessors, (144), 62 states have call successors, (62), 9 states have call predecessors, (62), 9 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 23:34:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 268 transitions. [2025-02-05 23:34:49,319 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 268 transitions. Word has length 172 [2025-02-05 23:34:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:49,321 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 268 transitions. [2025-02-05 23:34:49,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 268 transitions. [2025-02-05 23:34:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 23:34:49,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:49,326 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:49,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-05 23:34:49,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:34:49,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:49,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash 584009930, now seen corresponding path program 1 times [2025-02-05 23:34:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:34:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794496629] [2025-02-05 23:34:49,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:49,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:34:49,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:34:49,533 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:34:49,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-05 23:34:49,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 23:34:50,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 23:34:50,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:50,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:50,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 23:34:50,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:34:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 232 proven. 138 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2025-02-05 23:34:54,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:34:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 141 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2025-02-05 23:34:56,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:34:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794496629] [2025-02-05 23:34:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794496629] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:34:56,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:34:56,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-02-05 23:34:56,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629165350] [2025-02-05 23:34:56,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 23:34:56,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:34:56,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:34:56,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:34:56,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:34:56,810 INFO L87 Difference]: Start difference. First operand 191 states and 268 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 4 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 3 states have call predecessors, (52), 4 states have call successors, (52) [2025-02-05 23:35:02,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:35:06,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []