./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.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 8b032f5a857a45b1c2a35099704c59a34a967b916e033a3209200697cb561766 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:53:16,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:53:16,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:53:16,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:53:16,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:53:16,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:53:16,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:53:16,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:53:16,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:53:16,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:53:16,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:53:16,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:53:16,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:53:16,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:53:16,237 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:53:16,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:53:16,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:53:16,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:53:16,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:53:16,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:53:16,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:53:16,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:53:16,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:53:16,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:53:16,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:53:16,238 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 -> 8b032f5a857a45b1c2a35099704c59a34a967b916e033a3209200697cb561766 [2025-03-03 18:53:16,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:53:16,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:53:16,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:53:16,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:53:16,470 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:53:16,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i [2025-03-03 18:53:17,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02d6f3d7/f43e37b1baa341a9b1674859a23648eb/FLAGc2db2312a [2025-03-03 18:53:17,839 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:53:17,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i [2025-03-03 18:53:17,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02d6f3d7/f43e37b1baa341a9b1674859a23648eb/FLAGc2db2312a [2025-03-03 18:53:17,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02d6f3d7/f43e37b1baa341a9b1674859a23648eb [2025-03-03 18:53:17,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:53:17,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:53:17,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:53:17,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:53:17,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:53:17,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:53:17" (1/1) ... [2025-03-03 18:53:17,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd34262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:17, skipping insertion in model container [2025-03-03 18:53:17,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:53:17" (1/1) ... [2025-03-03 18:53:17,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:53:17,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i[913,926] [2025-03-03 18:53:18,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:53:18,048 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:53:18,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i[913,926] [2025-03-03 18:53:18,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:53:18,108 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:53:18,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18 WrapperNode [2025-03-03 18:53:18,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:53:18,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:53:18,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:53:18,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:53:18,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,150 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-03 18:53:18,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:53:18,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:53:18,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:53:18,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:53:18,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,184 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:53:18,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:53:18,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:53:18,213 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:53:18,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:53:18,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (1/1) ... [2025-03-03 18:53:18,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:53:18,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:53:18,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:53:18,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:53:18,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:53:18,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:53:18,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:53:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:53:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:53:18,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:53:18,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:53:18,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:53:18,591 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L135: havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2025-03-03 18:53:18,632 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 18:53:18,633 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:53:18,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:53:18,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:53:18,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:53:18 BoogieIcfgContainer [2025-03-03 18:53:18,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:53:18,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:53:18,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:53:18,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:53:18,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:53:17" (1/3) ... [2025-03-03 18:53:18,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c42df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:53:18, skipping insertion in model container [2025-03-03 18:53:18,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:18" (2/3) ... [2025-03-03 18:53:18,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c42df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:53:18, skipping insertion in model container [2025-03-03 18:53:18,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:53:18" (3/3) ... [2025-03-03 18:53:18,664 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-67.i [2025-03-03 18:53:18,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:53:18,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-67.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:53:18,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:53:18,727 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;@4394ebb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:53:18,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:53:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 18:53:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 18:53:18,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:53:18,745 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:53:18,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:53:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:53:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2021314912, now seen corresponding path program 1 times [2025-03-03 18:53:18,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:53:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439037570] [2025-03-03 18:53:18,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:18,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:53:18,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:53:18,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:53:18,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:18,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:53:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 18:53:19,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:53:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439037570] [2025-03-03 18:53:19,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439037570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:53:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111964796] [2025-03-03 18:53:19,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:19,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:53:19,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:53:19,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:53:19,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:53:19,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:53:19,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:53:19,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:19,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:53:19,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:53:19,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:53:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 18:53:19,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:53:19,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111964796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:53:19,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:53:19,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:53:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598238324] [2025-03-03 18:53:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:53:19,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:53:19,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:53:19,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:53:19,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:53:19,276 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 18:53:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:53:19,306 INFO L93 Difference]: Finished difference Result 164 states and 285 transitions. [2025-03-03 18:53:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:53:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2025-03-03 18:53:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:53:19,317 INFO L225 Difference]: With dead ends: 164 [2025-03-03 18:53:19,317 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 18:53:19,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:53:19,323 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:53:19,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:53:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 18:53:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 18:53:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 18:53:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2025-03-03 18:53:19,362 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 172 [2025-03-03 18:53:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:53:19,363 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2025-03-03 18:53:19,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 18:53:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2025-03-03 18:53:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 18:53:19,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:53:19,372 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:53:19,379 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-03 18:53:19,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:53:19,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:53:19,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:53:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1800858020, now seen corresponding path program 1 times [2025-03-03 18:53:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:53:19,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163247780] [2025-03-03 18:53:19,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:19,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:53:19,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:53:19,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:53:19,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:19,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:53:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 18:53:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:53:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163247780] [2025-03-03 18:53:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163247780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:53:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087808062] [2025-03-03 18:53:20,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:20,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:53:20,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:53:20,307 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:53:20,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:53:20,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:53:20,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:53:20,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:20,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:53:20,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 18:53:20,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:53:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2025-03-03 18:53:20,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:53:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 18:53:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087808062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:53:21,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:53:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 18:53:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616944494] [2025-03-03 18:53:21,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:53:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:53:21,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:53:21,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:53:21,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:53:21,014 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 18:53:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:53:21,305 INFO L93 Difference]: Finished difference Result 165 states and 250 transitions. [2025-03-03 18:53:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:53:21,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 172 [2025-03-03 18:53:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:53:21,309 INFO L225 Difference]: With dead ends: 165 [2025-03-03 18:53:21,310 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 18:53:21,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:53:21,314 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 194 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:53:21,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 179 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:53:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 18:53:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-03-03 18:53:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 18:53:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2025-03-03 18:53:21,336 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 172 [2025-03-03 18:53:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:53:21,337 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2025-03-03 18:53:21,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 18:53:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2025-03-03 18:53:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 18:53:21,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:53:21,339 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:53:21,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:53:21,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 18:53:21,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:53:21,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:53:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -578755873, now seen corresponding path program 1 times [2025-03-03 18:53:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:53:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133214636] [2025-03-03 18:53:21,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:53:21,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 18:53:21,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 18:53:21,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:21,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:53:21,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055030881] [2025-03-03 18:53:21,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:21,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:53:21,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:53:21,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:53:21,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:53:21,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 18:53:21,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 18:53:21,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:21,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:53:21,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:53:21,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 18:53:21,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 18:53:21,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:21,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:53:21,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:53:21,867 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:53:21,868 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:53:21,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:53:22,074 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-03 18:53:22,077 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 18:53:22,168 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:53:22,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:53:22 BoogieIcfgContainer [2025-03-03 18:53:22,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:53:22,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:53:22,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:53:22,176 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:53:22,176 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:53:18" (3/4) ... [2025-03-03 18:53:22,178 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:53:22,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:53:22,179 INFO L158 Benchmark]: Toolchain (without parser) took 4321.44ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 90.9MB in the end (delta: 22.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2025-03-03 18:53:22,179 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:53:22,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.13ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 100.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:53:22,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.56ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 97.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:53:22,180 INFO L158 Benchmark]: Boogie Preprocessor took 54.54ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:53:22,180 INFO L158 Benchmark]: IcfgBuilder took 440.45ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 71.2MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:53:22,180 INFO L158 Benchmark]: TraceAbstraction took 3519.53ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 90.9MB in the end (delta: -20.2MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2025-03-03 18:53:22,181 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 90.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:53:22,183 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.67ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.13ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 100.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.56ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 97.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.54ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 440.45ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 71.2MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3519.53ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 90.9MB in the end (delta: -20.2MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 90.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someUnaryFLOAToperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9.75; [L23] signed long int var_1_2 = 100; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_4 = 25; [L26] signed long int var_1_5 = 10; [L27] unsigned char var_1_6 = 1; [L28] float var_1_7 = 7.5; [L29] signed long int var_1_8 = -1000; [L30] float var_1_9 = 9.25; [L31] float var_1_10 = 64.5; [L32] float var_1_11 = 16.25; [L33] signed char var_1_12 = 2; [L34] signed char var_1_13 = 8; [L35] signed char var_1_14 = 0; [L36] float var_1_15 = 0.6; [L37] signed char var_1_16 = 32; [L38] unsigned short int var_1_17 = 2; [L39] unsigned char var_1_18 = 1; [L40] unsigned short int var_1_19 = 63241; [L41] unsigned short int var_1_20 = 58697; [L42] unsigned short int var_1_21 = 25516; [L43] unsigned long int var_1_22 = 3301682525; VAL [isInitial=0, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=100, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L89] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L90] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L90] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L91] var_1_4 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L92] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L93] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L93] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L94] var_1_5 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L95] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] var_1_6 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L98] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L99] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L99] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] var_1_8 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L101] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L102] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L102] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L103] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L103] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L104] var_1_9 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L106] var_1_10 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L107] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L109] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L110] var_1_13 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L111] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L112] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L112] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L113] var_1_14 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L114] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L115] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L115] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L116] var_1_18 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L117] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L118] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L118] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L119] var_1_19 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_19 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L120] RET assume_abort_if_not(var_1_19 >= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L121] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L121] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L122] var_1_20 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L123] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L124] CALL assume_abort_if_not(var_1_20 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L124] RET assume_abort_if_not(var_1_20 <= 65534) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L125] var_1_21 = __VERIFIER_nondet_ushort() [L126] CALL assume_abort_if_not(var_1_21 >= 24575) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L126] RET assume_abort_if_not(var_1_21 >= 24575) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L127] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L127] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L128] var_1_22 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L129] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L130] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L130] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L143] RET updateVariables() [L144] CALL step() [L47] COND TRUE 50 != var_1_2 [L48] var_1_1 = (1.00000000000025E12 - 24.25) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L50] var_1_3 = (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L51] COND FALSE !(((var_1_2 + 100) / var_1_8) >= var_1_5) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101] [L58] var_1_12 = (var_1_13 - var_1_14) [L59] var_1_15 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L60] COND FALSE !(var_1_1 > (var_1_11 + var_1_7)) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L69] COND TRUE \read(var_1_3) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L70] COND TRUE \read(var_1_6) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L71] COND TRUE \read(var_1_18) [L72] var_1_17 = var_1_14 VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR ((((((50 != var_1_2) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6)))) && ((((var_1_2 + 100) / var_1_8) >= var_1_5) ? ((var_1_3 || (var_1_5 > (var_1_4 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((var_1_1 > (var_1_11 + var_1_7)) ? ((var_1_14 < (((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2)) ? (var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L135-L136] return (((((((50 != var_1_2) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6)))) && ((((var_1_2 + 100) / var_1_8) >= var_1_5) ? ((var_1_3 || (var_1_5 > (var_1_4 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((var_1_1 > (var_1_11 + var_1_7)) ? ((var_1_14 < (((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2)) ? (var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1)) && (var_1_3 ? (var_1_6 ? (var_1_18 ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) (((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))) - ((var_1_21 - 256) - 256))))) : (((var_1_22 - var_1_20) > (var_1_4 / var_1_8)) ? ((var_1_15 >= var_1_10) ? (var_1_17 == ((unsigned short int) var_1_14)) : 1) : 1)) : (var_1_17 == ((unsigned short int) var_1_21))) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 203 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 515 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 SizeOfPredicates, 4 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 7317/7560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:53:22,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.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 8b032f5a857a45b1c2a35099704c59a34a967b916e033a3209200697cb561766 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:53:23,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:53:24,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:53:24,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:53:24,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:53:24,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:53:24,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:53:24,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:53:24,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:53:24,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:53:24,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:53:24,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:53:24,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:53:24,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:53:24,115 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:53:24,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:53:24,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:53:24,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:53:24,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:53:24,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:53:24,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:53:24,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:53:24,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:53:24,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:53:24,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:53:24,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:53:24,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:53:24,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:53:24,118 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:53:24,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:53:24,118 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:53:24,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:53:24,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:53:24,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:53:24,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:53:24,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:53:24,119 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 -> 8b032f5a857a45b1c2a35099704c59a34a967b916e033a3209200697cb561766 [2025-03-03 18:53:24,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:53:24,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:53:24,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:53:24,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:53:24,350 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:53:24,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i [2025-03-03 18:53:25,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068065a19/f8b0f1b741f443a4a57f28c74b46d443/FLAG62469652c [2025-03-03 18:53:25,681 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:53:25,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i [2025-03-03 18:53:25,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068065a19/f8b0f1b741f443a4a57f28c74b46d443/FLAG62469652c [2025-03-03 18:53:26,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068065a19/f8b0f1b741f443a4a57f28c74b46d443 [2025-03-03 18:53:26,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:53:26,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:53:26,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:53:26,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:53:26,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:53:26,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a7c857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26, skipping insertion in model container [2025-03-03 18:53:26,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:53:26,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i[913,926] [2025-03-03 18:53:26,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:53:26,235 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:53:26,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i[913,926] [2025-03-03 18:53:26,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:53:26,293 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:53:26,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26 WrapperNode [2025-03-03 18:53:26,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:53:26,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:53:26,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:53:26,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:53:26,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,335 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-03-03 18:53:26,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:53:26,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:53:26,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:53:26,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:53:26,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,361 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:53:26,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:53:26,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:53:26,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:53:26,385 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:53:26,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (1/1) ... [2025-03-03 18:53:26,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:53:26,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:53:26,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:53:26,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:53:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:53:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:53:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:53:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:53:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:53:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:53:26,486 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:53:26,488 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:53:28,083 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:53:28,083 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:53:28,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:53:28,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:53:28,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:53:28 BoogieIcfgContainer [2025-03-03 18:53:28,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:53:28,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:53:28,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:53:28,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:53:28,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:53:26" (1/3) ... [2025-03-03 18:53:28,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6743cd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:53:28, skipping insertion in model container [2025-03-03 18:53:28,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:53:26" (2/3) ... [2025-03-03 18:53:28,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6743cd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:53:28, skipping insertion in model container [2025-03-03 18:53:28,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:53:28" (3/3) ... [2025-03-03 18:53:28,104 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-67.i [2025-03-03 18:53:28,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:53:28,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-67.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:53:28,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:53:28,160 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;@404d690f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:53:28,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:53:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 18:53:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:53:28,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:53:28,175 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:53:28,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:53:28,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:53:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 923845672, now seen corresponding path program 1 times [2025-03-03 18:53:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:53:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961509855] [2025-03-03 18:53:28,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:28,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:53:28,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:53:28,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:53:28,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 18:53:28,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:53:28,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:53:28,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:28,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:53:28,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:53:28,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:53:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-03 18:53:28,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:53:28,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:53:28,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961509855] [2025-03-03 18:53:28,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961509855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:53:28,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:53:28,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:53:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298514933] [2025-03-03 18:53:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:53:28,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:53:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:53:28,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:53:28,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:53:28,539 INFO L87 Difference]: Start difference. First operand has 74 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 18:53:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:53:28,560 INFO L93 Difference]: Finished difference Result 142 states and 251 transitions. [2025-03-03 18:53:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:53:28,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2025-03-03 18:53:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:53:28,565 INFO L225 Difference]: With dead ends: 142 [2025-03-03 18:53:28,566 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 18:53:28,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:53:28,570 INFO L435 NwaCegarLoop]: 109 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, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:53:28,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:53:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 18:53:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 18:53:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 18:53:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2025-03-03 18:53:28,604 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 170 [2025-03-03 18:53:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:53:28,604 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2025-03-03 18:53:28,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 18:53:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2025-03-03 18:53:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:53:28,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:53:28,610 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:53:28,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:53:28,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:53:28,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:53:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:53:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash 668867948, now seen corresponding path program 1 times [2025-03-03 18:53:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:53:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017566288] [2025-03-03 18:53:28,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:28,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:53:28,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:53:28,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:53:28,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 18:53:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:53:29,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:53:29,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:29,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:53:29,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 18:53:29,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:53:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2025-03-03 18:53:29,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:53:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 18:53:29,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:53:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017566288] [2025-03-03 18:53:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017566288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:53:29,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:53:29,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 18:53:29,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118325427] [2025-03-03 18:53:29,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:53:29,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:53:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:53:29,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:53:29,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:53:29,868 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 18:53:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:53:31,097 INFO L93 Difference]: Finished difference Result 143 states and 216 transitions. [2025-03-03 18:53:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:53:31,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 170 [2025-03-03 18:53:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:53:31,118 INFO L225 Difference]: With dead ends: 143 [2025-03-03 18:53:31,118 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 18:53:31,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:53:31,119 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 119 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:53:31,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 140 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 18:53:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 18:53:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-03 18:53:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 18:53:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2025-03-03 18:53:31,133 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 170 [2025-03-03 18:53:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:53:31,133 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2025-03-03 18:53:31,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 18:53:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2025-03-03 18:53:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 18:53:31,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:53:31,136 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:53:31,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 18:53:31,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:53:31,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:53:31,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:53:31,337 INFO L85 PathProgramCache]: Analyzing trace with hash -372195801, now seen corresponding path program 1 times [2025-03-03 18:53:31,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:53:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532511888] [2025-03-03 18:53:31,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:31,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:53:31,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:53:31,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:53:31,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 18:53:31,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:53:31,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:53:31,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:31,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:53:31,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 18:53:31,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:54:17,436 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)