./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-77.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_operatoramount_amount50_file-77.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 3080751745ace4a5424c6116a03e4f3a2ea0bb277f15aed4801d2ca20d1f42cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:47:19,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:47:19,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:47:19,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:47:19,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:47:19,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:47:19,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:47:19,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:47:19,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:47:19,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:47:19,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:47:19,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:47:19,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:47:19,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:47:19,789 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:47:19,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:47:19,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:47:19,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:47:19,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:47:19,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:47:19,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:47:19,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:47:19,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:47:19,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:47:19,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:47:19,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:47:19,791 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 -> 3080751745ace4a5424c6116a03e4f3a2ea0bb277f15aed4801d2ca20d1f42cb [2025-03-04 00:47:20,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:47:20,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:47:20,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:47:20,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:47:20,046 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:47:20,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-77.i [2025-03-04 00:47:21,210 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a1bb2fe/3a25aeda8e844ec59b173f51ef8f291c/FLAG3c63cef01 [2025-03-04 00:47:21,447 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:47:21,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-77.i [2025-03-04 00:47:21,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a1bb2fe/3a25aeda8e844ec59b173f51ef8f291c/FLAG3c63cef01 [2025-03-04 00:47:21,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a1bb2fe/3a25aeda8e844ec59b173f51ef8f291c [2025-03-04 00:47:21,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:47:21,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:47:21,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:47:21,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:47:21,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:47:21,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:21,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21, skipping insertion in model container [2025-03-04 00:47:21,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:21,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:47:21,902 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_operatoramount_amount50_file-77.i[915,928] [2025-03-04 00:47:21,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:47:21,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:47:21,960 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_operatoramount_amount50_file-77.i[915,928] [2025-03-04 00:47:21,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:47:21,988 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:47:21,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21 WrapperNode [2025-03-04 00:47:21,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:47:21,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:47:21,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:47:21,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:47:21,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,023 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-04 00:47:22,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:47:22,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:47:22,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:47:22,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:47:22,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,046 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-04 00:47:22,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:47:22,067 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:47:22,067 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:47:22,067 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:47:22,071 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (1/1) ... [2025-03-04 00:47:22,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:47:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:47:22,102 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-04 00:47:22,104 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-04 00:47:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:47:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:47:22,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:47:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:47:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:47:22,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:47:22,174 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:47:22,175 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:47:22,435 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 00:47:22,435 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:47:22,444 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:47:22,447 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:47:22,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:47:22 BoogieIcfgContainer [2025-03-04 00:47:22,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:47:22,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:47:22,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:47:22,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:47:22,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:47:21" (1/3) ... [2025-03-04 00:47:22,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3474e640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:47:22, skipping insertion in model container [2025-03-04 00:47:22,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:21" (2/3) ... [2025-03-04 00:47:22,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3474e640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:47:22, skipping insertion in model container [2025-03-04 00:47:22,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:47:22" (3/3) ... [2025-03-04 00:47:22,454 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-77.i [2025-03-04 00:47:22,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:47:22,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-77.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:47:22,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:47:22,526 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;@32cef074, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:47:22,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:47:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:47:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 00:47:22,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:47:22,543 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:47:22,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:47:22,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:47:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash -571328227, now seen corresponding path program 1 times [2025-03-04 00:47:22,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:47:22,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626068517] [2025-03-04 00:47:22,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:47:22,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:22,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:22,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:22,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:47:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:47:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:47:22,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626068517] [2025-03-04 00:47:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626068517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:47:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430551352] [2025-03-04 00:47:22,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:47:22,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:47:22,776 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-04 00:47:22,777 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-04 00:47:22,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:22,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:22,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:22,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:47:22,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:47:22,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:47:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:47:22,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:47:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430551352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:47:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:47:22,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:47:22,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786367118] [2025-03-04 00:47:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:47:22,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:47:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:47:22,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:47:22,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:47:22,961 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:47:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:47:22,978 INFO L93 Difference]: Finished difference Result 116 states and 196 transitions. [2025-03-04 00:47:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:47:22,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2025-03-04 00:47:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:47:22,986 INFO L225 Difference]: With dead ends: 116 [2025-03-04 00:47:22,986 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 00:47:22,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-04 00:47:22,994 INFO L435 NwaCegarLoop]: 86 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, 86 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-04 00:47:22,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:47:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 00:47:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 00:47:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:47:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2025-03-04 00:47:23,027 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 124 [2025-03-04 00:47:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:47:23,028 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2025-03-04 00:47:23,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:47:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2025-03-04 00:47:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 00:47:23,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:47:23,031 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:47:23,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:47:23,232 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-04 00:47:23,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:47:23,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:47:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash 599104638, now seen corresponding path program 1 times [2025-03-04 00:47:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:47:23,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-03-04 00:47:23,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:23,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:47:23,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:23,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:23,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:23,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:47:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:47:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:47:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-03-04 00:47:23,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134081385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:47:23,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:47:23,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:47:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541207676] [2025-03-04 00:47:23,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:47:23,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:47:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:47:23,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:47:23,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:47:23,612 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:47:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:47:23,841 INFO L93 Difference]: Finished difference Result 175 states and 259 transitions. [2025-03-04 00:47:23,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:47:23,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2025-03-04 00:47:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:47:23,843 INFO L225 Difference]: With dead ends: 175 [2025-03-04 00:47:23,843 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 00:47:23,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:47:23,846 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 125 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:47:23,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 341 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:47:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 00:47:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2025-03-04 00:47:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:47:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 165 transitions. [2025-03-04 00:47:23,877 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 165 transitions. Word has length 124 [2025-03-04 00:47:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:47:23,877 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 165 transitions. [2025-03-04 00:47:23,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:47:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 165 transitions. [2025-03-04 00:47:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 00:47:23,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:47:23,879 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:47:23,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:47:23,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:47:23,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:47:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash 600028159, now seen corresponding path program 1 times [2025-03-04 00:47:23,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:47:23,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555228730] [2025-03-04 00:47:23,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:47:23,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:23,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:23,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:23,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:47:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:47:24,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:47:24,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555228730] [2025-03-04 00:47:24,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555228730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:47:24,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:47:24,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:47:24,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624708347] [2025-03-04 00:47:24,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:47:24,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:47:24,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:47:24,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:47:24,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:47:24,004 INFO L87 Difference]: Start difference. First operand 110 states and 165 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:47:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:47:24,036 INFO L93 Difference]: Finished difference Result 211 states and 319 transitions. [2025-03-04 00:47:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:47:24,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2025-03-04 00:47:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:47:24,044 INFO L225 Difference]: With dead ends: 211 [2025-03-04 00:47:24,044 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 00:47:24,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:47:24,048 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:47:24,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:47:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 00:47:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 57. [2025-03-04 00:47:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:47:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2025-03-04 00:47:24,061 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 124 [2025-03-04 00:47:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:47:24,061 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2025-03-04 00:47:24,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:47:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2025-03-04 00:47:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 00:47:24,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:47:24,065 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:47:24,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:47:24,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:47:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:47:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash 629580831, now seen corresponding path program 1 times [2025-03-04 00:47:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:47:24,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229692835] [2025-03-04 00:47:24,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:47:24,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:24,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:24,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:24,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:47:24,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826684702] [2025-03-04 00:47:24,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:24,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:47:24,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:47:24,232 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-04 00:47:24,232 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-04 00:47:24,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:24,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:24,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:24,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:47:24,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:47:24,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:24,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:24,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:24,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:47:24,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:47:24,441 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:47:24,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:47:24,449 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-04 00:47:24,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 00:47:24,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:47:24,715 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:47:24,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:47:24 BoogieIcfgContainer [2025-03-04 00:47:24,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:47:24,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:47:24,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:47:24,718 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:47:24,719 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:47:22" (3/4) ... [2025-03-04 00:47:24,720 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:47:24,721 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:47:24,721 INFO L158 Benchmark]: Toolchain (without parser) took 2935.57ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 77.9MB in the end (delta: 27.7MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2025-03-04 00:47:24,722 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:47:24,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.04ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:47:24,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.88ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:47:24,722 INFO L158 Benchmark]: Boogie Preprocessor took 42.20ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 84.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:47:24,722 INFO L158 Benchmark]: IcfgBuilder took 380.69ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 62.7MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:47:24,722 INFO L158 Benchmark]: TraceAbstraction took 2267.31ms. Allocated memory is still 142.6MB. Free memory was 62.7MB in the beginning and 77.9MB in the end (delta: -15.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:47:24,723 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 77.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:47:24,724 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.04ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.88ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.20ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 84.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 380.69ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 62.7MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2267.31ms. Allocated memory is still 142.6MB. Free memory was 62.7MB in the beginning and 77.9MB in the end (delta: -15.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 77.9MB in the end (delta: 37.0kB). 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 93, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] float var_1_6 = 255.25; [L27] unsigned short int var_1_7 = 16; [L28] signed char var_1_8 = -10; [L29] signed char var_1_9 = -8; [L30] unsigned short int var_1_10 = 8; [L31] unsigned short int var_1_11 = 10000; [L32] unsigned short int var_1_12 = 5; [L33] signed short int var_1_13 = 200; [L34] unsigned char var_1_15 = 0; [L35] unsigned short int var_1_16 = 35895; [L36] unsigned short int var_1_17 = 18336; [L37] unsigned char var_1_18 = 0; [L38] signed long int var_1_19 = -50; [L39] signed char last_1_var_1_8 = -10; [L40] unsigned char last_1_var_1_15 = 0; [L41] signed long int last_1_var_1_19 = -50; VAL [isInitial=0, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_2=511/2, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_15 = var_1_15 [L126] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_2=511/2, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L136] RET updateLastVariables() [L137] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L93] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L94] var_1_3 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L95] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L96] var_1_4 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L97] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L98] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L98] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L99] var_1_6 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=16, var_1_8=-10, var_1_9=-8] [L100] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=16, var_1_8=-10, var_1_9=-8] [L101] var_1_7 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_8=-10, var_1_9=-8] [L102] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_8=-10, var_1_9=-8] [L103] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L103] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L104] var_1_9 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L105] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L106] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L107] var_1_11 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L108] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L109] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L110] var_1_12 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L111] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L112] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L113] var_1_16 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L114] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L115] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L117] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L45] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L52] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16640, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L53] COND FALSE !(var_1_3 != var_1_6) [L60] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16640, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L62] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_0=0, stepLocal_1=16640, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L63] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L70] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16640, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_4=0, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L72] COND TRUE (- var_1_7) < (var_1_1 * var_1_4) [L73] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16640, var_1_10=8, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_4=0, var_1_7=-65535, var_1_8=1, var_1_9=1] [L75] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) [L76] unsigned short int stepLocal_4 = var_1_1; [L77] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L78] signed long int stepLocal_2 = - var_1_10; VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16640, stepLocal_2=-18241, stepLocal_3=130, stepLocal_4=-65535, var_1_10=18241, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_4=0, var_1_7=-65535, var_1_8=1, var_1_9=1] [L79] COND FALSE !(var_1_1 < stepLocal_2) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16640, stepLocal_3=130, stepLocal_4=-65535, var_1_10=18241, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_4=0, var_1_7=-65535, var_1_8=1, var_1_9=1] [L84] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L85] var_1_19 = ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=16640, stepLocal_3=130, var_1_10=18241, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_4=0, var_1_7=-65535, var_1_8=1, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= last_1_var_1_8) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_1 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (last_1_var_1_15 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_13 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_1 < (- var_1_10)) ? (((var_1_7 + (128 + var_1_1)) <= last_1_var_1_19) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_1 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18241, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_4=0, var_1_7=-65535, var_1_8=1, var_1_9=1] [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18241, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_4=0, var_1_7=-65535, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18241, var_1_11=-6152193, var_1_12=-6094848, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_4=0, var_1_7=-65535, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 582 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 330 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 252 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 57 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2700/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:47:24,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_operatoramount_amount50_file-77.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 3080751745ace4a5424c6116a03e4f3a2ea0bb277f15aed4801d2ca20d1f42cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:47:26,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:47:26,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:47:26,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:47:26,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:47:26,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:47:26,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:47:26,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:47:26,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:47:26,659 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:47:26,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:47:26,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:47:26,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:47:26,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:47:26,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:47:26,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:47:26,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:47:26,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:47:26,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:47:26,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:47:26,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:47:26,662 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:47:26,662 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:47:26,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:47:26,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:47:26,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:47:26,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:47:26,662 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 -> 3080751745ace4a5424c6116a03e4f3a2ea0bb277f15aed4801d2ca20d1f42cb [2025-03-04 00:47:26,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:47:26,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:47:26,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:47:26,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:47:26,910 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:47:26,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-77.i [2025-03-04 00:47:28,119 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b408bf163/ca0a2337ac2c46b19a137e74f717d974/FLAG98c833547 [2025-03-04 00:47:28,292 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:47:28,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-77.i [2025-03-04 00:47:28,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b408bf163/ca0a2337ac2c46b19a137e74f717d974/FLAG98c833547 [2025-03-04 00:47:28,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b408bf163/ca0a2337ac2c46b19a137e74f717d974 [2025-03-04 00:47:28,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:47:28,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:47:28,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:47:28,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:47:28,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:47:28,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5786af24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28, skipping insertion in model container [2025-03-04 00:47:28,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:47:28,460 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_operatoramount_amount50_file-77.i[915,928] [2025-03-04 00:47:28,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:47:28,531 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:47:28,538 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_operatoramount_amount50_file-77.i[915,928] [2025-03-04 00:47:28,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:47:28,571 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:47:28,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28 WrapperNode [2025-03-04 00:47:28,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:47:28,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:47:28,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:47:28,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:47:28,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,614 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-03-04 00:47:28,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:47:28,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:47:28,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:47:28,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:47:28,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,640 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-04 00:47:28,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:47:28,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:47:28,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:47:28,674 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:47:28,675 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (1/1) ... [2025-03-04 00:47:28,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:47:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:47:28,701 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-04 00:47:28,704 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-04 00:47:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:47:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:47:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:47:28,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:47:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:47:28,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:47:28,790 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:47:28,792 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:47:29,515 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 00:47:29,515 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:47:29,521 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:47:29,521 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:47:29,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:47:29 BoogieIcfgContainer [2025-03-04 00:47:29,522 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:47:29,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:47:29,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:47:29,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:47:29,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:47:28" (1/3) ... [2025-03-04 00:47:29,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5da734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:47:29, skipping insertion in model container [2025-03-04 00:47:29,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:47:28" (2/3) ... [2025-03-04 00:47:29,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5da734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:47:29, skipping insertion in model container [2025-03-04 00:47:29,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:47:29" (3/3) ... [2025-03-04 00:47:29,529 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-77.i [2025-03-04 00:47:29,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:47:29,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-77.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:47:29,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:47:29,588 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;@754ecd05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:47:29,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:47:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:47:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 00:47:29,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:47:29,600 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:47:29,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:47:29,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:47:29,607 INFO L85 PathProgramCache]: Analyzing trace with hash -571328227, now seen corresponding path program 1 times [2025-03-04 00:47:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:47:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803591066] [2025-03-04 00:47:29,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:29,617 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-04 00:47:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:47:29,620 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-04 00:47:29,621 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-04 00:47:29,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:29,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:29,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:29,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:47:29,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:47:29,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:47:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:47:29,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:47:29,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:47:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803591066] [2025-03-04 00:47:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803591066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:47:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:47:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:47:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582114215] [2025-03-04 00:47:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:47:29,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:47:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:47:29,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:47:29,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:47:29,907 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:47:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:47:29,924 INFO L93 Difference]: Finished difference Result 116 states and 196 transitions. [2025-03-04 00:47:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:47:29,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2025-03-04 00:47:29,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:47:29,929 INFO L225 Difference]: With dead ends: 116 [2025-03-04 00:47:29,930 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 00:47:29,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-04 00:47:29,933 INFO L435 NwaCegarLoop]: 86 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, 86 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-04 00:47:29,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:47:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 00:47:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 00:47:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:47:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2025-03-04 00:47:29,964 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 124 [2025-03-04 00:47:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:47:29,964 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2025-03-04 00:47:29,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:47:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2025-03-04 00:47:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 00:47:29,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:47:29,967 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:47:29,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:47:30,168 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-04 00:47:30,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:47:30,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:47:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash 599104638, now seen corresponding path program 1 times [2025-03-04 00:47:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:47:30,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207088453] [2025-03-04 00:47:30,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:30,170 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-04 00:47:30,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:47:30,172 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-04 00:47:30,172 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-04 00:47:30,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:30,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:30,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:30,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:47:30,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:47:30,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:47:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:47:30,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:47:30,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:47:30,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207088453] [2025-03-04 00:47:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207088453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:47:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:47:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:47:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227751547] [2025-03-04 00:47:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:47:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:47:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:47:30,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:47:30,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:47:30,410 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:47:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:47:30,596 INFO L93 Difference]: Finished difference Result 112 states and 167 transitions. [2025-03-04 00:47:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:47:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2025-03-04 00:47:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:47:30,604 INFO L225 Difference]: With dead ends: 112 [2025-03-04 00:47:30,604 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 00:47:30,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:47:30,605 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:47:30,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:47:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 00:47:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 00:47:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:47:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2025-03-04 00:47:30,613 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 124 [2025-03-04 00:47:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:47:30,614 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2025-03-04 00:47:30,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:47:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2025-03-04 00:47:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 00:47:30,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:47:30,616 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:47:30,623 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 (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:47:30,816 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-04 00:47:30,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:47:30,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:47:30,817 INFO L85 PathProgramCache]: Analyzing trace with hash 629580831, now seen corresponding path program 1 times [2025-03-04 00:47:30,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:47:30,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566064186] [2025-03-04 00:47:30,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:47:30,817 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-04 00:47:30,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:47:30,821 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-04 00:47:30,821 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-04 00:47:30,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 00:47:31,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 00:47:31,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:47:31,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:47:31,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 00:47:31,088 INFO L279 TraceCheckSpWp]: Computing forward predicates...