./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:15:39,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:15:39,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:15:39,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:15:39,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:15:39,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:15:39,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:15:39,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:15:39,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:15:39,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:15:39,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:15:39,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:15:39,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:15:39,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:15:39,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:15:39,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:15:39,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:15:39,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:15:39,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:15:39,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:15:39,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:15:39,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:15:39,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:15:39,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:15:39,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:15:39,415 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:15:39,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:15:39,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:15:39,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:15:39,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:15:39,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:15:39,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:15:39,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:15:39,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 [2025-03-03 19:15:39,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:15:39,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:15:39,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:15:39,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:15:39,654 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:15:39,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i [2025-03-03 19:15:40,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda30d8d8/4f4654d9c563403eae63c2ec0f3e635f/FLAGb422ff296 [2025-03-03 19:15:40,936 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:15:40,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i [2025-03-03 19:15:40,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda30d8d8/4f4654d9c563403eae63c2ec0f3e635f/FLAGb422ff296 [2025-03-03 19:15:41,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda30d8d8/4f4654d9c563403eae63c2ec0f3e635f [2025-03-03 19:15:41,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:15:41,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:15:41,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:15:41,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:15:41,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:15:41,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41, skipping insertion in model container [2025-03-03 19:15:41,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:15:41,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i[912,925] [2025-03-03 19:15:41,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:15:41,463 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:15:41,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i[912,925] [2025-03-03 19:15:41,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:15:41,509 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:15:41,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41 WrapperNode [2025-03-03 19:15:41,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:15:41,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:15:41,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:15:41,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:15:41,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,541 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-03-03 19:15:41,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:15:41,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:15:41,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:15:41,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:15:41,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,572 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:15:41,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,577 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:15:41,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:15:41,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:15:41,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:15:41,581 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (1/1) ... [2025-03-03 19:15:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:15:41,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:15:41,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:15:41,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:15:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:15:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:15:41,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:15:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:15:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:15:41,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:15:41,668 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:15:41,670 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:15:41,841 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:15:41,841 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:15:41,858 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:15:41,858 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:15:41,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:15:41 BoogieIcfgContainer [2025-03-03 19:15:41,859 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:15:41,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:15:41,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:15:41,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:15:41,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:15:41" (1/3) ... [2025-03-03 19:15:41,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a044d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:15:41, skipping insertion in model container [2025-03-03 19:15:41,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:41" (2/3) ... [2025-03-03 19:15:41,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a044d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:15:41, skipping insertion in model container [2025-03-03 19:15:41,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:15:41" (3/3) ... [2025-03-03 19:15:41,866 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-6.i [2025-03-03 19:15:41,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:15:41,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-6.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:15:41,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:15:41,934 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;@7b573ea7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:15:41,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:15:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 19:15:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 19:15:41,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:15:41,947 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:15:41,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:15:41,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:15:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1291121056, now seen corresponding path program 1 times [2025-03-03 19:15:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:15:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666117323] [2025-03-03 19:15:41,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:15:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:15:42,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 19:15:42,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 19:15:42,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:15:42,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:15:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 19:15:42,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:15:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666117323] [2025-03-03 19:15:42,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666117323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:15:42,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999562503] [2025-03-03 19:15:42,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:15:42,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:15:42,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:15:42,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:15:42,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:15:42,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 19:15:42,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 19:15:42,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:15:42,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:15:42,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:15:42,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:15:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 19:15:42,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:15:42,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999562503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:15:42,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:15:42,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:15:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896610238] [2025-03-03 19:15:42,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:15:42,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:15:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:15:42,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:15:42,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:15:42,336 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:15:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:15:42,352 INFO L93 Difference]: Finished difference Result 98 states and 158 transitions. [2025-03-03 19:15:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:15:42,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2025-03-03 19:15:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:15:42,357 INFO L225 Difference]: With dead ends: 98 [2025-03-03 19:15:42,357 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 19:15:42,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:15:42,361 INFO L435 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:15:42,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:15:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 19:15:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 19:15:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 19:15:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-03-03 19:15:42,386 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 91 [2025-03-03 19:15:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:15:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-03 19:15:42,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:15:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-03-03 19:15:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 19:15:42,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:15:42,389 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:15:42,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:15:42,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:15:42,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:15:42,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:15:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash 121280511, now seen corresponding path program 1 times [2025-03-03 19:15:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:15:42,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-03 19:15:42,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:15:42,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:15:42,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 19:15:42,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 19:15:42,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:15:42,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:15:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:15:42,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:15:42,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-03 19:15:42,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109407212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:15:42,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:15:42,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:15:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855796152] [2025-03-03 19:15:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:15:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:15:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:15:42,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:15:42,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:15:42,969 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:15:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:15:43,071 INFO L93 Difference]: Finished difference Result 142 states and 205 transitions. [2025-03-03 19:15:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:15:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-03 19:15:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:15:43,073 INFO L225 Difference]: With dead ends: 142 [2025-03-03 19:15:43,075 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 19:15:43,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:15:43,076 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:15:43,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 194 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:15:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 19:15:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2025-03-03 19:15:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:15:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2025-03-03 19:15:43,097 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 91 [2025-03-03 19:15:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:15:43,097 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2025-03-03 19:15:43,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:15:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2025-03-03 19:15:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 19:15:43,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:15:43,099 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:15:43,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:15:43,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:15:43,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:15:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash -658632021, now seen corresponding path program 1 times [2025-03-03 19:15:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:15:43,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87534598] [2025-03-03 19:15:43,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:15:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:15:43,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 19:15:43,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 19:15:43,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:15:43,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:15:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 19:15:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:15:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87534598] [2025-03-03 19:15:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87534598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:15:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677328941] [2025-03-03 19:15:43,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:15:43,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:15:43,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:15:43,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:15:43,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:15:43,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 19:15:43,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 19:15:43,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:15:43,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:15:43,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:15:43,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:15:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 19:15:43,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:15:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677328941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:15:43,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:15:43,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-03-03 19:15:43,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588211842] [2025-03-03 19:15:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:15:43,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:15:43,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:15:43,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:15:43,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:15:43,611 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:15:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:15:43,909 INFO L93 Difference]: Finished difference Result 194 states and 263 transitions. [2025-03-03 19:15:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 19:15:43,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2025-03-03 19:15:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:15:43,910 INFO L225 Difference]: With dead ends: 194 [2025-03-03 19:15:43,911 INFO L226 Difference]: Without dead ends: 148 [2025-03-03 19:15:43,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-03 19:15:43,912 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 103 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:15:43,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 302 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:15:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-03 19:15:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2025-03-03 19:15:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 97 states have internal predecessors, (116), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:15:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2025-03-03 19:15:43,938 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 92 [2025-03-03 19:15:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:15:43,939 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2025-03-03 19:15:43,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:15:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2025-03-03 19:15:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 19:15:43,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:15:43,941 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:15:43,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:15:44,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 19:15:44,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:15:44,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:15:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash -529549302, now seen corresponding path program 1 times [2025-03-03 19:15:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:15:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446833232] [2025-03-03 19:15:44,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:15:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:15:44,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 19:15:44,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 19:15:44,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:15:44,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:15:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715989591] [2025-03-03 19:15:44,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:15:44,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:15:44,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:15:44,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:15:44,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:15:44,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 19:15:44,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 19:15:44,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:15:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:15:44,271 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:15:44,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 19:15:44,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 19:15:44,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:15:44,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:15:44,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:15:44,338 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:15:44,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:15:44,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:15:44,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:15:44,547 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 19:15:44,607 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:15:44,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:15:44 BoogieIcfgContainer [2025-03-03 19:15:44,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:15:44,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:15:44,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:15:44,614 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:15:44,614 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:15:41" (3/4) ... [2025-03-03 19:15:44,616 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:15:44,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:15:44,617 INFO L158 Benchmark]: Toolchain (without parser) took 3331.79ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 130.0MB in the end (delta: -6.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:15:44,617 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:15:44,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.73ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 110.2MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:15:44,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.35ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:15:44,617 INFO L158 Benchmark]: Boogie Preprocessor took 35.06ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:15:44,618 INFO L158 Benchmark]: IcfgBuilder took 278.00ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:15:44,618 INFO L158 Benchmark]: TraceAbstraction took 2753.21ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 130.1MB in the end (delta: -40.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2025-03-03 19:15:44,618 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 130.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:15:44,619 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.15ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.73ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 110.2MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.35ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.06ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.00ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2753.21ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 130.1MB in the end (delta: -40.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 130.0MB 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] double var_1_5 = 1.9; [L24] double var_1_6 = 7.5; [L25] double var_1_7 = 64.25; [L26] signed long int var_1_8 = 2; [L27] signed long int var_1_9 = 1000000000; [L28] signed long int var_1_10 = 1000000000; [L29] signed long int var_1_11 = 1957998270; [L30] float var_1_12 = 50.25; [L31] float var_1_13 = 9.8; [L32] float var_1_14 = 25.5; [L33] float var_1_15 = 3.5; [L34] signed long int var_1_16 = -500; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] double last_1_var_1_1 = 100.25; [L39] signed long int last_1_var_1_8 = 2; [L40] float last_1_var_1_12 = 50.25; [L41] signed long int last_1_var_1_16 = -500; [L42] unsigned char last_1_var_1_17 = 1; [L43] unsigned char last_1_var_1_19 = 0; VAL [isInitial=0, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L109] last_1_var_1_1 = var_1_1 [L110] last_1_var_1_8 = var_1_8 [L111] last_1_var_1_12 = var_1_12 [L112] last_1_var_1_16 = var_1_16 [L113] last_1_var_1_17 = var_1_17 [L114] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L85] var_1_5 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L86] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] var_1_6 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L88] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L89] var_1_7 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L90] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L91] var_1_9 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L92] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L94] var_1_10 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L95] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L97] var_1_11 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L98] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L100] var_1_14 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L101] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L103] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L104] var_1_18 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L105] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L125] RET updateVariables() [L126] CALL step() [L47] COND TRUE \read(last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L48] COND FALSE !(var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L54] COND FALSE !((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L61] var_1_8 = (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16))))) [L62] signed long int stepLocal_1 = (((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9)); VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_1=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=999, var_1_9=536870911] [L63] COND TRUE stepLocal_1 >= (var_1_16 - var_1_11) [L64] var_1_12 = var_1_7 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L66] var_1_17 = (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) [L67] signed long int stepLocal_2 = var_1_16; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_2=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L68] COND TRUE stepLocal_2 < var_1_11 [L69] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L73] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L74] COND FALSE !(\read(var_1_19)) [L81] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L126] RET step() [L127] CALL, EXPR property() [L117-L118] return ((((((var_1_19 ? ((var_1_8 >= var_1_8) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16)))))))) && ((((((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9))) >= (var_1_16 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_16 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((last_1_var_1_8) < (var_1_10)) ? (last_1_var_1_8) : (var_1_10)))) ? (last_1_var_1_19 ? (var_1_16 == ((signed long int) last_1_var_1_8)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (last_1_var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 566 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 220 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 641 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 738 SizeOfPredicates, 1 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1533/1560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:15:44,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:15:46,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:15:46,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:15:46,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:15:46,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:15:46,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:15:46,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:15:46,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:15:46,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:15:46,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:15:46,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:15:46,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:15:46,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:15:46,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:15:46,581 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:15:46,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:15:46,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:15:46,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:15:46,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:15:46,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:15:46,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:15:46,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:15:46,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:15:46,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:15:46,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:15:46,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:15:46,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:15:46,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:15:46,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:15:46,584 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:15:46,585 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:15:46,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:15:46,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:15:46,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:15:46,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:15:46,585 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 [2025-03-03 19:15:46,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:15:46,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:15:46,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:15:46,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:15:46,819 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:15:46,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i [2025-03-03 19:15:47,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d05b30/3b261ca2f4734d0194dadba2da884ccf/FLAGdddad5022 [2025-03-03 19:15:48,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:15:48,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i [2025-03-03 19:15:48,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d05b30/3b261ca2f4734d0194dadba2da884ccf/FLAGdddad5022 [2025-03-03 19:15:48,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d05b30/3b261ca2f4734d0194dadba2da884ccf [2025-03-03 19:15:48,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:15:48,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:15:48,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:15:48,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:15:48,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:15:48,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184066a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48, skipping insertion in model container [2025-03-03 19:15:48,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:15:48,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i[912,925] [2025-03-03 19:15:48,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:15:48,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:15:48,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i[912,925] [2025-03-03 19:15:48,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:15:48,434 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:15:48,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48 WrapperNode [2025-03-03 19:15:48,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:15:48,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:15:48,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:15:48,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:15:48,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,483 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-03 19:15:48,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:15:48,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:15:48,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:15:48,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:15:48,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,516 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:15:48,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:15:48,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:15:48,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:15:48,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:15:48,534 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (1/1) ... [2025-03-03 19:15:48,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:15:48,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:15:48,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:15:48,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:15:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:15:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:15:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:15:48,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:15:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:15:48,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:15:48,650 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:15:48,651 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:16:13,903 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:16:13,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:16:13,909 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:16:13,910 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:16:13,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:16:13 BoogieIcfgContainer [2025-03-03 19:16:13,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:16:13,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:16:13,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:16:13,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:16:13,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:15:48" (1/3) ... [2025-03-03 19:16:13,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188febb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:16:13, skipping insertion in model container [2025-03-03 19:16:13,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:15:48" (2/3) ... [2025-03-03 19:16:13,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188febb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:16:13, skipping insertion in model container [2025-03-03 19:16:13,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:16:13" (3/3) ... [2025-03-03 19:16:13,917 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-6.i [2025-03-03 19:16:13,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:16:13,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-6.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:16:13,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:16:13,966 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;@2f7cdd20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:16:13,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:16:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 19:16:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 19:16:13,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:16:13,975 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:16:13,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:16:13,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:16:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1291121056, now seen corresponding path program 1 times [2025-03-03 19:16:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:16:13,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422081724] [2025-03-03 19:16:13,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:16:13,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:16:13,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:16:13,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:16:13,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:16:14,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 19:16:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 19:16:14,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:16:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:16:14,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:16:14,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:16:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 19:16:14,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:16:14,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:16:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422081724] [2025-03-03 19:16:14,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422081724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:16:14,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:16:14,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:16:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845374913] [2025-03-03 19:16:14,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:16:14,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:16:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:16:14,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:16:14,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:16:14,759 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:16:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:16:14,772 INFO L93 Difference]: Finished difference Result 98 states and 158 transitions. [2025-03-03 19:16:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:16:14,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2025-03-03 19:16:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:16:14,779 INFO L225 Difference]: With dead ends: 98 [2025-03-03 19:16:14,779 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 19:16:14,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:16:14,782 INFO L435 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:16:14,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:16:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 19:16:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 19:16:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 19:16:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-03-03 19:16:14,805 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 91 [2025-03-03 19:16:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:16:14,805 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-03 19:16:14,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:16:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-03-03 19:16:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 19:16:14,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:16:14,808 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:16:14,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:16:15,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:16:15,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:16:15,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:16:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash 121280511, now seen corresponding path program 1 times [2025-03-03 19:16:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:16:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483344620] [2025-03-03 19:16:15,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:16:15,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:16:15,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:16:15,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:16:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:16:15,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 19:16:15,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 19:16:15,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:16:15,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:16:15,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 19:16:15,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:16:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 19:16:17,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:16:17,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:16:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483344620] [2025-03-03 19:16:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483344620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:16:17,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:16:17,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:16:17,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816452240] [2025-03-03 19:16:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:16:17,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:16:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:16:17,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:16:17,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:16:17,741 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:16:22,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:16:26,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:16:30,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:16:34,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:16:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:16:34,837 INFO L93 Difference]: Finished difference Result 142 states and 205 transitions. [2025-03-03 19:16:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:16:34,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-03 19:16:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:16:34,928 INFO L225 Difference]: With dead ends: 142 [2025-03-03 19:16:34,928 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 19:16:34,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:16:34,929 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:16:34,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 17.0s Time] [2025-03-03 19:16:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 19:16:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2025-03-03 19:16:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:16:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2025-03-03 19:16:34,940 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 91 [2025-03-03 19:16:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:16:34,941 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2025-03-03 19:16:34,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 19:16:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2025-03-03 19:16:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 19:16:34,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:16:34,942 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:16:34,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 19:16:35,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:16:35,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:16:35,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:16:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash -658632021, now seen corresponding path program 1 times [2025-03-03 19:16:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:16:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757634095] [2025-03-03 19:16:35,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:16:35,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:16:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:16:35,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:16:35,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:16:35,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 19:16:35,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 19:16:35,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:16:35,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:16:35,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:16:35,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:16:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 19:16:37,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:16:37,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:16:37,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757634095] [2025-03-03 19:16:37,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757634095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:16:37,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:16:37,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:16:37,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249124654] [2025-03-03 19:16:37,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:16:37,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:16:37,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:16:37,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:16:37,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:16:37,379 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 19:16:43,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:16:47,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:16:52,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:16:56,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:17:00,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:17:04,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:17:08,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:17:12,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:17:16,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:17:20,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:17:24,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:17:28,105 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 []