./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.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 2ca49ab820ec7b63f08a2ce22e67a701d1d86b8ff13cf45853d7baabaed2f9ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:54:24,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:54:24,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:54:24,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:54:24,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:54:24,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:54:24,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:54:24,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:54:24,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:54:24,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:54:24,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:54:24,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:54:24,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:54:24,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:54:24,918 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:54:24,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:54:24,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:54:24,919 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:54:24,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:54:24,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:54:24,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:54:24,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:54:24,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:54:24,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:54:24,920 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:54:24,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:54:24,920 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:54:24,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:54:24,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:54:24,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:54:24,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:54:24,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:54:24,922 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 -> 2ca49ab820ec7b63f08a2ce22e67a701d1d86b8ff13cf45853d7baabaed2f9ad [2025-03-16 23:54:25,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:54:25,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:54:25,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:54:25,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:54:25,150 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:54:25,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2025-03-16 23:54:26,257 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa82ba9da/1ba940d9300248bd9d7e42db1742dd02/FLAGad215dcb0 [2025-03-16 23:54:26,458 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:54:26,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2025-03-16 23:54:26,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa82ba9da/1ba940d9300248bd9d7e42db1742dd02/FLAGad215dcb0 [2025-03-16 23:54:26,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa82ba9da/1ba940d9300248bd9d7e42db1742dd02 [2025-03-16 23:54:26,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:54:26,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:54:26,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:54:26,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:54:26,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:54:26,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:54:26" (1/1) ... [2025-03-16 23:54:26,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164659a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:26, skipping insertion in model container [2025-03-16 23:54:26,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:54:26" (1/1) ... [2025-03-16 23:54:26,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:54:26,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i[915,928] [2025-03-16 23:54:26,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:54:26,982 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:54:26,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i[915,928] [2025-03-16 23:54:27,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:54:27,024 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:54:27,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27 WrapperNode [2025-03-16 23:54:27,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:54:27,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:54:27,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:54:27,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:54:27,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,070 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-03-16 23:54:27,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:54:27,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:54:27,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:54:27,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:54:27,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,092 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-16 23:54:27,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:54:27,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:54:27,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:54:27,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:54:27,118 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (1/1) ... [2025-03-16 23:54:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:54:27,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:54:27,142 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-16 23:54:27,146 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-16 23:54:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:54:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:54:27,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:54:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:54:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:54:27,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:54:27,224 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:54:27,225 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:54:27,437 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:54:27,437 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:54:27,448 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:54:27,448 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:54:27,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:54:27 BoogieIcfgContainer [2025-03-16 23:54:27,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:54:27,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:54:27,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:54:27,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:54:27,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:54:26" (1/3) ... [2025-03-16 23:54:27,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bafab43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:54:27, skipping insertion in model container [2025-03-16 23:54:27,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:27" (2/3) ... [2025-03-16 23:54:27,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bafab43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:54:27, skipping insertion in model container [2025-03-16 23:54:27,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:54:27" (3/3) ... [2025-03-16 23:54:27,455 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2025-03-16 23:54:27,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:54:27,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-41.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:54:27,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:54:27,519 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;@190eed1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:54:27,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:54:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:54:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 23:54:27,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:27,533 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:54:27,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:27,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash 499226509, now seen corresponding path program 1 times [2025-03-16 23:54:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:27,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553178675] [2025-03-16 23:54:27,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:27,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:27,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:27,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:27,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:27,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:54:27,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553178675] [2025-03-16 23:54:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553178675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:54:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974777397] [2025-03-16 23:54:27,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:27,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:54:27,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:54:27,780 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-16 23:54:27,782 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-16 23:54:27,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:27,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:27,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:27,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:27,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:54:27,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:54:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:54:27,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:54:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974777397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:27,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:54:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:54:27,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924021487] [2025-03-16 23:54:27,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:54:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:27,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:54:27,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:54:27,998 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:54:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:28,017 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2025-03-16 23:54:28,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:54:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-03-16 23:54:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:28,024 INFO L225 Difference]: With dead ends: 115 [2025-03-16 23:54:28,024 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 23:54:28,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:54:28,031 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:28,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:54:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 23:54:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-16 23:54:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:54:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-16 23:54:28,062 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 128 [2025-03-16 23:54:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:28,062 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-16 23:54:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:54:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-16 23:54:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 23:54:28,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:28,064 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:54:28,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:54:28,264 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-16 23:54:28,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:28,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:28,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1616570261, now seen corresponding path program 1 times [2025-03-16 23:54:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:28,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888624815] [2025-03-16 23:54:28,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:28,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:28,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:28,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:28,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:28,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:54:28,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962504314] [2025-03-16 23:54:28,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:28,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:54:28,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:54:28,488 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-16 23:54:28,489 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-16 23:54:28,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:28,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:28,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:28,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:28,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 23:54:28,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:54:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-16 23:54:29,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:54:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-16 23:54:29,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:29,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888624815] [2025-03-16 23:54:29,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 23:54:29,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962504314] [2025-03-16 23:54:29,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962504314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:54:29,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:54:29,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-03-16 23:54:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239934904] [2025-03-16 23:54:29,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:54:29,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:54:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:29,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:54:29,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:54:29,645 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-16 23:54:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:30,369 INFO L93 Difference]: Finished difference Result 165 states and 233 transitions. [2025-03-16 23:54:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 23:54:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 128 [2025-03-16 23:54:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:30,371 INFO L225 Difference]: With dead ends: 165 [2025-03-16 23:54:30,372 INFO L226 Difference]: Without dead ends: 109 [2025-03-16 23:54:30,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2025-03-16 23:54:30,374 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 237 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:30,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 251 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:54:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-16 23:54:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2025-03-16 23:54:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 60 states have internal predecessors, (72), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:54:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-03-16 23:54:30,393 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 128 [2025-03-16 23:54:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:30,394 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-03-16 23:54:30,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-16 23:54:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-03-16 23:54:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:54:30,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:30,397 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:54:30,404 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-16 23:54:30,598 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-16 23:54:30,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:30,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1428791353, now seen corresponding path program 1 times [2025-03-16 23:54:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:30,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177036586] [2025-03-16 23:54:30,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:30,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:54:30,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:54:30,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:30,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:54:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549287796] [2025-03-16 23:54:30,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:30,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:54:30,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:54:30,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:54:30,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:54:30,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:54:30,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:54:30,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:30,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:54:30,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:54:30,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:54:30,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:54:30,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:30,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:54:31,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:54:31,007 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:54:31,007 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:54:31,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 23:54:31,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:54:31,211 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 23:54:31,275 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:54:31,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:54:31 BoogieIcfgContainer [2025-03-16 23:54:31,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:54:31,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:54:31,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:54:31,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:54:31,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:54:27" (3/4) ... [2025-03-16 23:54:31,282 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:54:31,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:54:31,286 INFO L158 Benchmark]: Toolchain (without parser) took 4454.72ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 76.1MB in the end (delta: 30.0MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2025-03-16 23:54:31,286 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:54:31,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.16ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:54:31,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.61ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:54:31,286 INFO L158 Benchmark]: Boogie Preprocessor took 46.60ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:54:31,286 INFO L158 Benchmark]: IcfgBuilder took 330.68ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 62.1MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:54:31,287 INFO L158 Benchmark]: TraceAbstraction took 3829.09ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 76.1MB in the end (delta: -15.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:54:31,287 INFO L158 Benchmark]: Witness Printer took 5.51ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 76.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:54:31,288 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.47ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.16ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.61ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.60ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 330.68ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 62.1MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3829.09ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 76.1MB in the end (delta: -15.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.51ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 76.1MB in the end (delta: 41.6kB). 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 139, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] signed short int var_1_24 = 25; [L39] float var_1_25 = 32.6; [L40] signed short int var_1_26 = 8; [L41] unsigned char var_1_27 = 50; [L42] unsigned char var_1_28 = 8; [L43] signed short int var_1_29 = 10; [L44] signed long int var_1_30 = -4; [L45] signed char var_1_31 = -50; [L46] signed char var_1_32 = -32; [L47] unsigned char last_1_var_1_15 = 8; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] CALL updateLastVariables() [L136] last_1_var_1_15 = var_1_15 [L146] RET updateLastVariables() [L147] CALL updateVariables() [L103] var_1_4 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] var_1_5 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L109] var_1_11 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L112] var_1_12 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L115] var_1_14 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] var_1_16 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] var_1_18 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_25=163/5, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L123] var_1_25 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_25 >= -922337.2036854776000e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] RET assume_abort_if_not((var_1_25 >= -922337.2036854776000e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=8, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] var_1_26 = __VERIFIER_nondet_short() [L126] CALL assume_abort_if_not(var_1_26 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L126] RET assume_abort_if_not(var_1_26 >= -32766) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] CALL assume_abort_if_not(var_1_26 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] RET assume_abort_if_not(var_1_26 <= 32766) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=8, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L128] var_1_28 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L129] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L130] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L130] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L131] var_1_32 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_32 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L132] RET assume_abort_if_not(var_1_32 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L133] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L133] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L147] RET updateVariables() [L148] CALL step() [L51] COND FALSE !(32.2f > (25.5f - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=50, var_1_28=0, var_1_29=10, var_1_30=-4, var_1_31=-50, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L54] var_1_27 = var_1_28 [L55] var_1_29 = var_1_26 [L56] var_1_30 = var_1_29 [L57] var_1_31 = var_1_32 [L58] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L59] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L66] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L71] COND TRUE (- var_1_13) > 31.9f [L72] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L76] COND TRUE \read(var_1_1) [L77] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L79] var_1_22 = 1 [L80] var_1_23 = var_1_22 [L81] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L82] COND FALSE !(var_1_15 > stepLocal_0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L85] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=0, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=8192, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L86] COND TRUE var_1_1 || stepLocal_2 [L87] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=8192, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L91] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=8192, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=8192, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L95] COND FALSE !(! (var_1_17 <= var_1_17)) [L98] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=8192, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] RET step() [L149] CALL, EXPR property() [L139-L140] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=8192, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=8192, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=25, var_1_26=-32766, var_1_27=0, var_1_28=0, var_1_29=-32766, var_1_30=-32766, var_1_31=-127, var_1_32=-127, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 111 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 141 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 1537 SizeOfPredicates, 4 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2930/3040 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-16 23:54:31,306 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_fillercode_fillercodesize_ps-cn-10_file-41.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 2ca49ab820ec7b63f08a2ce22e67a701d1d86b8ff13cf45853d7baabaed2f9ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:54:33,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:54:33,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:54:33,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:54:33,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:54:33,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:54:33,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:54:33,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:54:33,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:54:33,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:54:33,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:54:33,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:54:33,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:54:33,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:54:33,252 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:54:33,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:54:33,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:54:33,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:54:33,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:54:33,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:54:33,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:54:33,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:54:33,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:54:33,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:54:33,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:54:33,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:54:33,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:54:33,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:54:33,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:54:33,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:54:33,255 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:54:33,255 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:54:33,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:54:33,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:54:33,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:54:33,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:54:33,256 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 -> 2ca49ab820ec7b63f08a2ce22e67a701d1d86b8ff13cf45853d7baabaed2f9ad [2025-03-16 23:54:33,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:54:33,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:54:33,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:54:33,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:54:33,490 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:54:33,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2025-03-16 23:54:34,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d60d09c7/b3c46f3e5e654501a0585be37cfffc82/FLAGb7f3ad27a [2025-03-16 23:54:34,779 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:54:34,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2025-03-16 23:54:34,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d60d09c7/b3c46f3e5e654501a0585be37cfffc82/FLAGb7f3ad27a [2025-03-16 23:54:35,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d60d09c7/b3c46f3e5e654501a0585be37cfffc82 [2025-03-16 23:54:35,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:54:35,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:54:35,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:54:35,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:54:35,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:54:35,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2437eaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35, skipping insertion in model container [2025-03-16 23:54:35,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:54:35,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i[915,928] [2025-03-16 23:54:35,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:54:35,300 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:54:35,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-41.i[915,928] [2025-03-16 23:54:35,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:54:35,336 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:54:35,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35 WrapperNode [2025-03-16 23:54:35,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:54:35,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:54:35,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:54:35,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:54:35,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,373 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-16 23:54:35,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:54:35,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:54:35,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:54:35,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:54:35,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,404 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-16 23:54:35,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:54:35,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:54:35,427 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:54:35,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:54:35,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (1/1) ... [2025-03-16 23:54:35,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:54:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:54:35,450 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-16 23:54:35,452 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-16 23:54:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:54:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:54:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:54:35,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:54:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:54:35,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:54:35,523 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:54:35,524 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:54:39,741 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:54:39,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:54:39,747 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:54:39,747 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:54:39,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:54:39 BoogieIcfgContainer [2025-03-16 23:54:39,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:54:39,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:54:39,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:54:39,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:54:39,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:54:35" (1/3) ... [2025-03-16 23:54:39,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cee8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:54:39, skipping insertion in model container [2025-03-16 23:54:39,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:54:35" (2/3) ... [2025-03-16 23:54:39,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cee8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:54:39, skipping insertion in model container [2025-03-16 23:54:39,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:54:39" (3/3) ... [2025-03-16 23:54:39,754 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-41.i [2025-03-16 23:54:39,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:54:39,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-41.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:54:39,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:54:39,802 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;@781605db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:54:39,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:54:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:54:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 23:54:39,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:39,815 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:54:39,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:39,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:39,819 INFO L85 PathProgramCache]: Analyzing trace with hash 499226509, now seen corresponding path program 1 times [2025-03-16 23:54:39,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:54:39,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369150148] [2025-03-16 23:54:39,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:39,826 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-16 23:54:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:54:39,828 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-16 23:54:39,830 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-16 23:54:39,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:40,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:40,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:40,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:40,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:54:40,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:54:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-16 23:54:40,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:54:40,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:54:40,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369150148] [2025-03-16 23:54:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369150148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:40,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:54:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440601936] [2025-03-16 23:54:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:40,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:54:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:54:40,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:54:40,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:54:40,177 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:54:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:40,196 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2025-03-16 23:54:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:54:40,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-03-16 23:54:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:40,216 INFO L225 Difference]: With dead ends: 115 [2025-03-16 23:54:40,216 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 23:54:40,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-16 23:54:40,220 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:40,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:54:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 23:54:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-16 23:54:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:54:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-16 23:54:40,251 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 128 [2025-03-16 23:54:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:40,252 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-16 23:54:40,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:54:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-16 23:54:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 23:54:40,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:40,256 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:54:40,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:54:40,457 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-16 23:54:40,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:40,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1616570261, now seen corresponding path program 1 times [2025-03-16 23:54:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:54:40,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451788882] [2025-03-16 23:54:40,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:40,459 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-16 23:54:40,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:54:40,462 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-16 23:54:40,466 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-16 23:54:40,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:40,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:40,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:40,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:40,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 23:54:40,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:54:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-16 23:54:41,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:54:41,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:54:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451788882] [2025-03-16 23:54:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451788882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:41,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:41,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:54:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400623847] [2025-03-16 23:54:41,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:41,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:54:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:54:41,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:54:41,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:54:41,961 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:54:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:44,893 INFO L93 Difference]: Finished difference Result 168 states and 254 transitions. [2025-03-16 23:54:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:54:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-16 23:54:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:44,897 INFO L225 Difference]: With dead ends: 168 [2025-03-16 23:54:44,897 INFO L226 Difference]: Without dead ends: 112 [2025-03-16 23:54:44,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:54:44,898 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 20 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:44,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 151 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 23:54:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-16 23:54:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-03-16 23:54:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-16 23:54:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 164 transitions. [2025-03-16 23:54:44,915 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 164 transitions. Word has length 128 [2025-03-16 23:54:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:44,916 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 164 transitions. [2025-03-16 23:54:44,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:54:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 164 transitions. [2025-03-16 23:54:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 23:54:44,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:44,917 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:54:44,926 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-16 23:54:45,117 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-16 23:54:45,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:45,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash 881445676, now seen corresponding path program 1 times [2025-03-16 23:54:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:54:45,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253380556] [2025-03-16 23:54:45,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:45,119 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-16 23:54:45,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:54:45,121 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-16 23:54:45,125 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-16 23:54:45,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:45,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:45,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:45,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:45,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 23:54:45,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:54:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 403 proven. 42 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-16 23:54:46,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:54:47,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:54:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253380556] [2025-03-16 23:54:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253380556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:54:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1663095679] [2025-03-16 23:54:47,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-16 23:54:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-16 23:54:47,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-16 23:54:47,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-16 23:54:47,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:48,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:48,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:48,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:48,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:54:48,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:54:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-16 23:54:48,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:54:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1663095679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:54:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-16 23:54:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918430004] [2025-03-16 23:54:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:48,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:54:48,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:54:48,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:54:48,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:54:48,437 INFO L87 Difference]: Start difference. First operand 109 states and 164 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:54:50,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:54:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:50,672 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2025-03-16 23:54:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 23:54:50,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-16 23:54:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:50,675 INFO L225 Difference]: With dead ends: 325 [2025-03-16 23:54:50,675 INFO L226 Difference]: Without dead ends: 217 [2025-03-16 23:54:50,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:54:50,677 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 78 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:50,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 487 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 23:54:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-16 23:54:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2025-03-16 23:54:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 130 states have (on average 1.2461538461538462) internal successors, (162), 130 states have internal predecessors, (162), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-16 23:54:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 322 transitions. [2025-03-16 23:54:50,702 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 322 transitions. Word has length 128 [2025-03-16 23:54:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:50,702 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 322 transitions. [2025-03-16 23:54:50,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:54:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 322 transitions. [2025-03-16 23:54:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 23:54:50,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:50,704 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:54:50,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-16 23:54:50,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-16 23:54:51,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-16 23:54:51,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:51,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash -861364659, now seen corresponding path program 1 times [2025-03-16 23:54:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:54:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142704217] [2025-03-16 23:54:51,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:51,106 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-16 23:54:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:54:51,108 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:54:51,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-16 23:54:51,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:54:51,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:54:51,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:51,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:51,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 23:54:51,369 INFO L279 TraceCheckSpWp]: Computing forward predicates...