./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.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_codestructure_normal_file-32.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 a1cbd694c9eed06f1e9279ceeb8d61e9debe17c32801c70f5b1c8faace63fe8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:49:01,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:49:01,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:49:01,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:49:01,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:49:01,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:49:01,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:49:01,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:49:01,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:49:01,512 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:49:01,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:49:01,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:49:01,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:49:01,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:49:01,513 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:49:01,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:49:01,514 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:49:01,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:49:01,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:49:01,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:49:01,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:49:01,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:49:01,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:49:01,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:49:01,516 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 -> a1cbd694c9eed06f1e9279ceeb8d61e9debe17c32801c70f5b1c8faace63fe8f [2025-03-03 18:49:01,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:49:01,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:49:01,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:49:01,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:49:01,750 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:49:01,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i [2025-03-03 18:49:02,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92dbc209/102990d22ae4442d9917eaf9df4bed03/FLAGc7dda4aba [2025-03-03 18:49:03,183 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:49:03,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i [2025-03-03 18:49:03,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92dbc209/102990d22ae4442d9917eaf9df4bed03/FLAGc7dda4aba [2025-03-03 18:49:03,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92dbc209/102990d22ae4442d9917eaf9df4bed03 [2025-03-03 18:49:03,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:49:03,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:49:03,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:49:03,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:49:03,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:49:03,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03, skipping insertion in model container [2025-03-03 18:49:03,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:49:03,368 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_codestructure_normal_file-32.i[913,926] [2025-03-03 18:49:03,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:49:03,411 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:49:03,420 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_codestructure_normal_file-32.i[913,926] [2025-03-03 18:49:03,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:49:03,460 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:49:03,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03 WrapperNode [2025-03-03 18:49:03,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:49:03,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:49:03,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:49:03,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:49:03,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,499 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-03-03 18:49:03,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:49:03,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:49:03,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:49:03,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:49:03,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,521 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:49:03,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:49:03,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:49:03,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:49:03,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:49:03,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (1/1) ... [2025-03-03 18:49:03,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:49:03,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:49:03,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:49:03,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:49:03,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:49:03,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:49:03,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:49:03,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:49:03,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:49:03,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:49:03,635 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:49:03,637 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:49:03,890 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:49:03,890 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:49:03,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:49:03,897 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:49:03,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:49:03 BoogieIcfgContainer [2025-03-03 18:49:03,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:49:03,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:49:03,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:49:03,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:49:03,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:49:03" (1/3) ... [2025-03-03 18:49:03,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593362eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:49:03, skipping insertion in model container [2025-03-03 18:49:03,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:03" (2/3) ... [2025-03-03 18:49:03,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593362eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:49:03, skipping insertion in model container [2025-03-03 18:49:03,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:49:03" (3/3) ... [2025-03-03 18:49:03,905 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-32.i [2025-03-03 18:49:03,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:49:03,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-32.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:49:03,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:49:03,961 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;@4fc58569, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:49:03,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:49:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 18:49:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 18:49:03,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:03,973 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:03,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:03,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash -940863037, now seen corresponding path program 1 times [2025-03-03 18:49:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:03,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384956317] [2025-03-03 18:49:03,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:04,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:49:04,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:49:04,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:04,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 18:49:04,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384956317] [2025-03-03 18:49:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384956317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:49:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193086714] [2025-03-03 18:49:04,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:49:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:49:04,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:49:04,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:49:04,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:49:04,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:49:04,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:04,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:04,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:49:04,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:49:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 18:49:04,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:49:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193086714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:04,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:49:04,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:49:04,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695069015] [2025-03-03 18:49:04,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:04,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:49:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:04,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:49:04,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:49:04,417 INFO L87 Difference]: Start difference. First operand has 71 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 18:49:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:04,438 INFO L93 Difference]: Finished difference Result 136 states and 239 transitions. [2025-03-03 18:49:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:49:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2025-03-03 18:49:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:04,444 INFO L225 Difference]: With dead ends: 136 [2025-03-03 18:49:04,444 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 18:49:04,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:49:04,448 INFO L435 NwaCegarLoop]: 104 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, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:04,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:49:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 18:49:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 18:49:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 18:49:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-03-03 18:49:04,476 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 161 [2025-03-03 18:49:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:04,476 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-03-03 18:49:04,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 18:49:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-03-03 18:49:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 18:49:04,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:04,481 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:04,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:49:04,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:49:04,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:04,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1451469727, now seen corresponding path program 1 times [2025-03-03 18:49:04,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:04,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298982679] [2025-03-03 18:49:04,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:04,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:49:04,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:49:04,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:04,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 18:49:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298982679] [2025-03-03 18:49:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298982679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:49:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137216524] [2025-03-03 18:49:05,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:49:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:49:05,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:49:05,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:49:05,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:49:05,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:49:05,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:05,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:05,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 18:49:05,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:49:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2025-03-03 18:49:05,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:49:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 18:49:05,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137216524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:49:05,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:49:05,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 18:49:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735165532] [2025-03-03 18:49:05,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:49:05,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:49:05,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:05,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:49:05,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:49:05,460 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 18:49:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:05,778 INFO L93 Difference]: Finished difference Result 176 states and 268 transitions. [2025-03-03 18:49:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:49:05,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 161 [2025-03-03 18:49:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:05,781 INFO L225 Difference]: With dead ends: 176 [2025-03-03 18:49:05,782 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 18:49:05,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 319 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:49:05,784 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 97 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:05,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 246 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:49:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 18:49:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2025-03-03 18:49:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 18:49:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 161 transitions. [2025-03-03 18:49:05,797 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 161 transitions. Word has length 161 [2025-03-03 18:49:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:05,798 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 161 transitions. [2025-03-03 18:49:05,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 18:49:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2025-03-03 18:49:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 18:49:05,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:05,800 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:05,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 18:49:06,000 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,SelfDestructingSolverStorable1 [2025-03-03 18:49:06,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:06,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1299763798, now seen corresponding path program 1 times [2025-03-03 18:49:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406217217] [2025-03-03 18:49:06,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:06,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 18:49:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 18:49:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:49:06,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:49:06,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 18:49:06,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 18:49:06,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:06,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:49:06,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:49:06,181 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:49:06,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:49:06,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:49:06,188 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 18:49:06,277 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:49:06,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:49:06 BoogieIcfgContainer [2025-03-03 18:49:06,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:49:06,283 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:49:06,283 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:49:06,283 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:49:06,284 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:49:03" (3/4) ... [2025-03-03 18:49:06,286 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:49:06,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:49:06,287 INFO L158 Benchmark]: Toolchain (without parser) took 3063.00ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 112.4MB in the beginning and 306.6MB in the end (delta: -194.2MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2025-03-03 18:49:06,287 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:49:06,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.66ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:49:06,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.05ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 95.7MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:49:06,288 INFO L158 Benchmark]: Boogie Preprocessor took 29.42ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 91.0MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:49:06,289 INFO L158 Benchmark]: IcfgBuilder took 365.85ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 70.1MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:49:06,289 INFO L158 Benchmark]: TraceAbstraction took 2382.91ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 69.1MB in the beginning and 306.7MB in the end (delta: -237.5MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2025-03-03 18:49:06,289 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 385.9MB. Free memory was 306.7MB in the beginning and 306.6MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:49:06,290 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.66ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.05ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 95.7MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.42ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 91.0MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 365.85ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 70.1MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2382.91ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 69.1MB in the beginning and 306.7MB in the end (delta: -237.5MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 385.9MB. Free memory was 306.7MB in the beginning and 306.6MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -25; [L25] unsigned char var_1_4 = 100; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 64; [L28] unsigned char var_1_7 = 32; [L29] unsigned char var_1_8 = 32; [L30] float var_1_9 = 100.5; [L31] unsigned char var_1_10 = 4; [L32] float var_1_11 = 0.8; [L33] float var_1_12 = 2.5; [L34] signed short int var_1_13 = -32; [L35] float var_1_14 = 3.2; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 0; [L38] unsigned char var_1_17 = 0; [L39] float var_1_18 = 0.25; [L40] float var_1_19 = 100000000.25; [L41] signed char var_1_20 = 0; [L42] signed char var_1_21 = 10; [L43] double var_1_22 = 1000000.5; [L44] unsigned long int var_1_23 = 256; [L45] unsigned long int var_1_24 = 50; VAL [isInitial=0, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] var_1_3 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] var_1_5 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L103] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L103] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L104] var_1_6 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L105] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L106] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L106] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L107] var_1_7 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L108] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L109] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L109] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L110] var_1_8 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L111] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L112] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L112] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L113] var_1_10 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L115] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L115] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L116] var_1_11 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L118] var_1_12 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L120] var_1_14 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L121] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] var_1_16 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L123] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L124] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L124] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L125] var_1_17 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L126] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L127] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L127] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L128] var_1_19 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L129] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L130] var_1_21 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L131] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L132] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L132] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L145] RET updateVariables() [L146] CALL step() [L49] COND TRUE -32 < var_1_3 [L50] var_1_1 = (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=0, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L52] COND FALSE !((var_1_10 + ((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) == var_1_5) [L55] var_1_9 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=0, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L57] COND FALSE !((var_1_12 * ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) > (- var_1_14)) VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=0, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L66] COND FALSE !(var_1_5 >= var_1_6) [L75] var_1_15 = var_1_17 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=0, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L77] COND TRUE var_1_17 || var_1_15 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=0, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L78] COND FALSE !(var_1_15 && var_1_2) [L81] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=0, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L84] COND TRUE var_1_11 == var_1_18 [L85] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=0, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L87] var_1_22 = var_1_12 [L88] var_1_23 = var_1_8 [L89] var_1_24 = var_1_6 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=0, var_1_20=64, var_1_21=-31, var_1_22=100000006, var_1_23=63, var_1_24=64, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((((((-32 < var_1_3) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_10 + ((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) > (- var_1_14)) ? ((var_1_6 <= var_1_8) ? (var_1_2 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((var_1_13 <= var_1_10) ? (var_1_15 == ((unsigned char) var_1_16)) : ((var_1_2 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_2) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=0, var_1_20=64, var_1_21=-31, var_1_22=100000006, var_1_23=63, var_1_24=64, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=0, var_1_20=64, var_1_21=-31, var_1_22=100000006, var_1_23=63, var_1_24=64, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=0, var_1_20=64, var_1_21=-31, var_1_22=100000006, var_1_23=63, var_1_24=64, var_1_2=0, var_1_3=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000006] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 212 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 481 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 800 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 6414/6500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:49:06,309 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_codestructure_normal_file-32.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 a1cbd694c9eed06f1e9279ceeb8d61e9debe17c32801c70f5b1c8faace63fe8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:49:08,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:49:08,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:49:08,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:49:08,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:49:08,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:49:08,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:49:08,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:49:08,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:49:08,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:49:08,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:49:08,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:49:08,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:49:08,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:49:08,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:49:08,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:49:08,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:49:08,191 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 -> a1cbd694c9eed06f1e9279ceeb8d61e9debe17c32801c70f5b1c8faace63fe8f [2025-03-03 18:49:08,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:49:08,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:49:08,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:49:08,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:49:08,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:49:08,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i [2025-03-03 18:49:09,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f43dc8b/a042b51c8e094442bdfddbab4aaeb12e/FLAG08cdff1fe [2025-03-03 18:49:09,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:49:09,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-32.i [2025-03-03 18:49:09,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f43dc8b/a042b51c8e094442bdfddbab4aaeb12e/FLAG08cdff1fe [2025-03-03 18:49:10,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f43dc8b/a042b51c8e094442bdfddbab4aaeb12e [2025-03-03 18:49:10,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:49:10,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:49:10,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:49:10,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:49:10,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:49:10,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a58a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10, skipping insertion in model container [2025-03-03 18:49:10,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:49:10,248 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_codestructure_normal_file-32.i[913,926] [2025-03-03 18:49:10,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:49:10,315 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:49:10,323 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_codestructure_normal_file-32.i[913,926] [2025-03-03 18:49:10,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:49:10,364 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:49:10,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10 WrapperNode [2025-03-03 18:49:10,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:49:10,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:49:10,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:49:10,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:49:10,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,406 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-03-03 18:49:10,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:49:10,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:49:10,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:49:10,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:49:10,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,430 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:49:10,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:49:10,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:49:10,446 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:49:10,446 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:49:10,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (1/1) ... [2025-03-03 18:49:10,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:49:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:49:10,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:49:10,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:49:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:49:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:49:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:49:10,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:49:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:49:10,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:49:10,546 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:49:10,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:49:13,360 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:49:13,360 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:49:13,367 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:49:13,368 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:49:13,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:49:13 BoogieIcfgContainer [2025-03-03 18:49:13,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:49:13,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:49:13,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:49:13,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:49:13,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:49:10" (1/3) ... [2025-03-03 18:49:13,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391c4356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:49:13, skipping insertion in model container [2025-03-03 18:49:13,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:10" (2/3) ... [2025-03-03 18:49:13,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391c4356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:49:13, skipping insertion in model container [2025-03-03 18:49:13,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:49:13" (3/3) ... [2025-03-03 18:49:13,378 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-32.i [2025-03-03 18:49:13,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:49:13,389 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-32.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:49:13,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:49:13,433 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;@6039c179, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:49:13,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:49:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 18:49:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 18:49:13,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:13,445 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:13,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:13,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash -940863037, now seen corresponding path program 1 times [2025-03-03 18:49:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:49:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413963938] [2025-03-03 18:49:13,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:13,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:49:13,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:49:13,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:49:13,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 18:49:13,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:49:13,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:49:13,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:13,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:13,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:49:13,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:49:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-03 18:49:13,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:49:13,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:49:13,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413963938] [2025-03-03 18:49:13,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413963938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:13,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:13,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:49:13,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390259552] [2025-03-03 18:49:13,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:13,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:49:13,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:49:13,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:49:13,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:49:13,799 INFO L87 Difference]: Start difference. First operand has 71 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 18:49:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:13,825 INFO L93 Difference]: Finished difference Result 136 states and 239 transitions. [2025-03-03 18:49:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:49:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2025-03-03 18:49:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:13,831 INFO L225 Difference]: With dead ends: 136 [2025-03-03 18:49:13,831 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 18:49:13,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:49:13,837 INFO L435 NwaCegarLoop]: 104 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, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:13,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:49:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 18:49:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 18:49:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 18:49:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-03-03 18:49:13,874 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 161 [2025-03-03 18:49:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:13,875 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-03-03 18:49:13,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 18:49:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-03-03 18:49:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 18:49:13,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:13,879 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:13,888 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-03 18:49:14,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:49:14,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1451469727, now seen corresponding path program 1 times [2025-03-03 18:49:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:49:14,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727422935] [2025-03-03 18:49:14,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:14,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:49:14,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:49:14,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:49:14,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 18:49:14,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:49:14,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:49:14,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:14,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:14,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 18:49:14,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:49:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2025-03-03 18:49:14,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:49:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 18:49:14,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:49:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727422935] [2025-03-03 18:49:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727422935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:49:14,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:49:14,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 18:49:14,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199174399] [2025-03-03 18:49:14,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:49:14,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:49:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:49:14,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:49:14,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:49:14,797 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 18:49:16,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 18:49:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:17,257 INFO L93 Difference]: Finished difference Result 176 states and 268 transitions. [2025-03-03 18:49:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:49:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 161 [2025-03-03 18:49:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:17,260 INFO L225 Difference]: With dead ends: 176 [2025-03-03 18:49:17,260 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 18:49:17,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:49:17,261 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 60 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:17,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 275 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 18:49:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 18:49:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2025-03-03 18:49:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 18:49:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 161 transitions. [2025-03-03 18:49:17,277 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 161 transitions. Word has length 161 [2025-03-03 18:49:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:17,278 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 161 transitions. [2025-03-03 18:49:17,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 18:49:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2025-03-03 18:49:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 18:49:17,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:17,279 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:17,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 18:49:17,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:49:17,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:17,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1299763798, now seen corresponding path program 1 times [2025-03-03 18:49:17,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:49:17,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127742098] [2025-03-03 18:49:17,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:17,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:49:17,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:49:17,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:49:17,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 18:49:17,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 18:49:17,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 18:49:17,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:17,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:17,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 18:49:17,816 INFO L279 TraceCheckSpWp]: Computing forward predicates...