./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.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 86663a1cbbd8911dd5f20f51fde174aa6fa49f328dd842d1c9d2dbaf89183ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:01:51,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:01:51,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:01:51,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:01:51,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:01:51,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:01:51,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:01:51,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:01:51,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:01:51,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:01:51,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:01:51,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:01:51,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:01:51,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:01:51,237 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:01:51,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:01:51,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:01:51,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:01:51,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:01:51,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:01:51,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:01:51,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:01:51,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:01:51,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:01:51,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:01:51,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:01:51,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:01:51,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:01:51,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:01:51,239 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 -> 86663a1cbbd8911dd5f20f51fde174aa6fa49f328dd842d1c9d2dbaf89183ee7 [2025-03-17 03:01:51,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:01:51,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:01:51,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:01:51,522 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:01:51,522 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:01:51,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-03-17 03:01:52,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a865aace/aa1768f0813a4b8cb7a5cc77ddaecd4a/FLAG0da5e6958 [2025-03-17 03:01:52,995 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:01:52,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-03-17 03:01:53,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a865aace/aa1768f0813a4b8cb7a5cc77ddaecd4a/FLAG0da5e6958 [2025-03-17 03:01:53,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a865aace/aa1768f0813a4b8cb7a5cc77ddaecd4a [2025-03-17 03:01:53,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:01:53,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:01:53,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:01:53,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:01:53,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:01:53,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c3be5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53, skipping insertion in model container [2025-03-17 03:01:53,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:01:53,140 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_loopvsstraightlinecode_100-1loop_file-17.i[916,929] [2025-03-17 03:01:53,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:01:53,210 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:01:53,221 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_loopvsstraightlinecode_100-1loop_file-17.i[916,929] [2025-03-17 03:01:53,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:01:53,263 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:01:53,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53 WrapperNode [2025-03-17 03:01:53,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:01:53,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:01:53,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:01:53,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:01:53,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,320 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2025-03-17 03:01:53,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:01:53,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:01:53,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:01:53,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:01:53,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,360 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-17 03:01:53,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:01:53,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:01:53,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:01:53,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:01:53,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (1/1) ... [2025-03-17 03:01:53,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:01:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:53,427 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-17 03:01:53,431 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-17 03:01:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:01:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:01:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:01:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:01:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:01:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:01:53,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:01:53,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:01:53,893 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: havoc property_#t~bitwise20#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-17 03:01:53,926 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-17 03:01:53,926 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:01:53,948 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:01:53,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:01:53,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:53 BoogieIcfgContainer [2025-03-17 03:01:53,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:01:53,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:01:53,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:01:53,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:01:53,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:01:53" (1/3) ... [2025-03-17 03:01:53,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0e05a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:53, skipping insertion in model container [2025-03-17 03:01:53,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:53" (2/3) ... [2025-03-17 03:01:53,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0e05a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:53, skipping insertion in model container [2025-03-17 03:01:53,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:53" (3/3) ... [2025-03-17 03:01:53,958 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-03-17 03:01:53,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:01:53,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-17.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:01:54,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:01:54,027 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;@5ec5df47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:01:54,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:01:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:01:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:01:54,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:54,043 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:01:54,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:54,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1445018197, now seen corresponding path program 1 times [2025-03-17 03:01:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986457070] [2025-03-17 03:01:54,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:54,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:01:54,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:01:54,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:54,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 03:01:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986457070] [2025-03-17 03:01:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986457070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:01:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713936154] [2025-03-17 03:01:54,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:54,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:01:54,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:54,354 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-17 03:01:54,355 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-17 03:01:54,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:01:54,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:01:54,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:54,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:54,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:01:54,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:01:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 03:01:54,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:01:54,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713936154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:54,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:01:54,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:01:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987612184] [2025-03-17 03:01:54,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:54,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:01:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:54,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:01:54,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:01:54,541 INFO L87 Difference]: Start difference. First operand has 91 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:01:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:54,570 INFO L93 Difference]: Finished difference Result 181 states and 303 transitions. [2025-03-17 03:01:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:01:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-03-17 03:01:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:54,576 INFO L225 Difference]: With dead ends: 181 [2025-03-17 03:01:54,576 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 03:01:54,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-17 03:01:54,580 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:54,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:01:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 03:01:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 03:01:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:01:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2025-03-17 03:01:54,610 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 164 [2025-03-17 03:01:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:54,612 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2025-03-17 03:01:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:01:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2025-03-17 03:01:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:01:54,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:54,614 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:01:54,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:01:54,814 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-17 03:01:54,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1518720175, now seen corresponding path program 1 times [2025-03-17 03:01:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170506494] [2025-03-17 03:01:54,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:54,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:01:54,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:01:54,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:54,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:01:55,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170506494] [2025-03-17 03:01:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170506494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:55,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:55,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:01:55,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208209753] [2025-03-17 03:01:55,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:55,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:01:55,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:55,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:01:55,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:01:55,209 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:01:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:55,459 INFO L93 Difference]: Finished difference Result 277 states and 426 transitions. [2025-03-17 03:01:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:01:55,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-03-17 03:01:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:55,462 INFO L225 Difference]: With dead ends: 277 [2025-03-17 03:01:55,463 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 03:01:55,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:01:55,464 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 197 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:55,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 363 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:01:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 03:01:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 174. [2025-03-17 03:01:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 123 states have internal predecessors, (171), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:01:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 267 transitions. [2025-03-17 03:01:55,493 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 267 transitions. Word has length 164 [2025-03-17 03:01:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:55,494 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 267 transitions. [2025-03-17 03:01:55,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:01:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 267 transitions. [2025-03-17 03:01:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:01:55,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:55,499 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:01:55,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:01:55,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:55,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1398725145, now seen corresponding path program 1 times [2025-03-17 03:01:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:55,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199269213] [2025-03-17 03:01:55,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:55,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:01:55,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:01:55,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:55,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:01:56,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:56,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199269213] [2025-03-17 03:01:56,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199269213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:56,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:01:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630687269] [2025-03-17 03:01:56,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:56,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:01:56,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:56,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:01:56,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:01:56,598 INFO L87 Difference]: Start difference. First operand 174 states and 267 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:01:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:57,278 INFO L93 Difference]: Finished difference Result 452 states and 688 transitions. [2025-03-17 03:01:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:01:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-17 03:01:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:57,281 INFO L225 Difference]: With dead ends: 452 [2025-03-17 03:01:57,281 INFO L226 Difference]: Without dead ends: 364 [2025-03-17 03:01:57,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:01:57,283 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 364 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:57,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 499 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:01:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-17 03:01:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 230. [2025-03-17 03:01:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:01:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2025-03-17 03:01:57,333 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 165 [2025-03-17 03:01:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:57,333 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2025-03-17 03:01:57,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:01:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2025-03-17 03:01:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:01:57,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:57,335 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:01:57,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:01:57,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:57,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 554253274, now seen corresponding path program 1 times [2025-03-17 03:01:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966746888] [2025-03-17 03:01:57,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:57,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:01:57,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:01:57,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:57,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:01:57,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688578742] [2025-03-17 03:01:57,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:57,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:01:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:57,474 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-17 03:01:57,475 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-17 03:01:57,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:01:57,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:01:57,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:57,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:57,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 03:01:57,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:01:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:01:58,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:01:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:58,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966746888] [2025-03-17 03:01:58,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 03:01:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688578742] [2025-03-17 03:01:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688578742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:01:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898637996] [2025-03-17 03:01:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:58,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:01:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:58,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:01:58,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:01:58,005 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:01:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:58,185 INFO L93 Difference]: Finished difference Result 481 states and 736 transitions. [2025-03-17 03:01:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:01:58,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-17 03:01:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:58,188 INFO L225 Difference]: With dead ends: 481 [2025-03-17 03:01:58,188 INFO L226 Difference]: Without dead ends: 300 [2025-03-17 03:01:58,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:01:58,189 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 93 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:58,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 440 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:01:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-17 03:01:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 230. [2025-03-17 03:01:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:01:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2025-03-17 03:01:58,240 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 165 [2025-03-17 03:01:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:58,240 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2025-03-17 03:01:58,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:01:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2025-03-17 03:01:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 03:01:58,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:58,244 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:01:58,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:01:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 03:01:58,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 929369073, now seen corresponding path program 1 times [2025-03-17 03:01:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:58,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396129059] [2025-03-17 03:01:58,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:58,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:01:58,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:01:58,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:58,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:01:58,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046363534] [2025-03-17 03:01:58,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:01:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:58,534 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-17 03:01:58,536 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-17 03:01:58,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:01:58,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:01:58,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:58,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:01:58,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:01:58,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:01:58,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:01:58,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:58,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:01:58,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:01:58,807 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:01:58,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:01:58,818 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-17 03:01:59,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:01:59,015 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:01:59,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:01:59,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:01:59 BoogieIcfgContainer [2025-03-17 03:01:59,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:01:59,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:01:59,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:01:59,109 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:01:59,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:53" (3/4) ... [2025-03-17 03:01:59,111 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:01:59,111 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:01:59,112 INFO L158 Benchmark]: Toolchain (without parser) took 6092.67ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.6MB in the beginning and 58.7MB in the end (delta: 53.8MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2025-03-17 03:01:59,112 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:01:59,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.69ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:01:59,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.95ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.3MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:01:59,113 INFO L158 Benchmark]: Boogie Preprocessor took 75.76ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 84.7MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:01:59,113 INFO L158 Benchmark]: IcfgBuilder took 549.62ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 51.8MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 03:01:59,113 INFO L158 Benchmark]: TraceAbstraction took 5156.77ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 51.3MB in the beginning and 58.8MB in the end (delta: -7.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2025-03-17 03:01:59,113 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 176.2MB. Free memory was 58.8MB in the beginning and 58.7MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:01:59,114 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.69ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.95ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.3MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.76ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 84.7MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 549.62ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 51.8MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5156.77ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 51.3MB in the beginning and 58.8MB in the end (delta: -7.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 176.2MB. Free memory was 58.8MB in the beginning and 58.7MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. 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 114, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someUnaryDOUBLEoperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_8 = 0; [L24] unsigned char var_1_9 = 1; [L25] signed short int var_1_10 = 1000; [L26] signed long int var_1_11 = -10; [L27] signed short int var_1_12 = 16; [L28] signed short int var_1_14 = 0; [L29] double var_1_16 = 7.3; [L30] double var_1_17 = 0.2; [L31] float var_1_18 = 3.5; [L32] float var_1_19 = 128.2; [L33] float var_1_20 = 5.8; [L34] signed char var_1_21 = 16; [L35] unsigned char var_1_22 = 1; [L36] signed long int var_1_23 = -128; [L37] unsigned short int var_1_24 = 128; [L38] float var_1_26 = 31.25; [L39] float var_1_27 = 0.6; [L40] float var_1_28 = 127.2; [L41] float var_1_29 = 128.18; [L42] float var_1_30 = 31.8; [L43] unsigned char var_1_31 = 25; [L44] unsigned char var_1_33 = 5; [L45] unsigned char var_1_34 = 2; [L46] unsigned char var_1_35 = 128; [L47] unsigned char last_1_var_1_1 = 1; [L48] signed short int last_1_var_1_14 = 0; [L49] signed long int last_1_var_1_23 = -128; [L50] unsigned char last_1_var_1_31 = 25; [L182] isInitial = 1 [L183] FCALL initially() [L184] int k_loop; [L185] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L185] COND TRUE k_loop < 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_14 = var_1_14 [L174] last_1_var_1_23 = var_1_23 [L175] last_1_var_1_31 = var_1_31 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L132] var_1_8 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L138] var_1_11 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L142] var_1_12 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L147] var_1_19 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L148] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L149] var_1_21 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_21 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_21 >= -128) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L153] var_1_27 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L155] var_1_28 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L157] var_1_29 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L159] var_1_30 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L161] var_1_33 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L162] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_33 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 <= 64) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L164] var_1_34 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L165] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L167] var_1_35 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_35 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not(var_1_35 >= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L187] RET updateVariables() [L188] CALL step() [L54] COND TRUE (-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11) [L55] var_1_10 = ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L59] signed long int stepLocal_8 = last_1_var_1_14; [L60] unsigned char stepLocal_7 = last_1_var_1_14 <= (last_1_var_1_14 * var_1_12); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_7=1, stepLocal_8=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L61] COND TRUE stepLocal_7 && last_1_var_1_1 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_8=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L62] COND FALSE !(last_1_var_1_31 <= stepLocal_8) [L69] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L74] var_1_14 = (-2 + (last_1_var_1_31 + last_1_var_1_31)) [L75] unsigned char stepLocal_1 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_1=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L76] COND TRUE stepLocal_1 == (-128 * var_1_31) [L77] var_1_16 = (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L81] COND FALSE !(\read(var_1_8)) [L84] var_1_26 = ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L86] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_6=-128, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L87] COND TRUE stepLocal_6 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14)))) [L88] var_1_24 = ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L92] signed long int stepLocal_5 = 25 * var_1_14; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L93] COND TRUE ! (var_1_31 <= var_1_10) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L94] COND FALSE !(var_1_10 >= stepLocal_5) [L97] var_1_23 = ((var_1_10 + var_1_14) + var_1_24) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L100] unsigned char stepLocal_0 = ((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L101] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L101] COND TRUE ((var_1_31 | var_1_24) <= var_1_31) || stepLocal_0 [L102] var_1_1 = ((! 1) && var_1_8) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L106] unsigned char stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_2=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L107] COND TRUE ((var_1_24 + -16) * var_1_23) >= stepLocal_2 [L108] var_1_18 = (64.9f + var_1_19) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L112] signed long int stepLocal_3 = var_1_14 % var_1_21; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=48, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L113] EXPR var_1_31 & var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=48, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L113] COND TRUE stepLocal_3 >= (var_1_31 & var_1_24) [L114] var_1_20 = ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L118] unsigned long int stepLocal_4 = ~ (var_1_31 * 128u); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L119] COND FALSE !(! (var_1_10 <= var_1_23)) [L128] var_1_22 = var_1_9 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L188] RET step() [L189] CALL, EXPR property() [L178] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L178] EXPR ((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L178-L179] return (((((((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19)))) && ((! (var_1_10 <= var_1_23)) ? (var_1_1 ? (((~ (var_1_31 * 128u)) == var_1_23) ? (var_1_22 == ((unsigned char) (! var_1_9))) : 1) : (var_1_22 == ((unsigned char) var_1_9))) : (var_1_22 == ((unsigned char) var_1_9)))) && ((! (var_1_31 <= var_1_10)) ? ((var_1_10 >= (25 * var_1_14)) ? (var_1_23 == ((signed long int) ((((var_1_24) < (var_1_10)) ? (var_1_24) : (var_1_10))))) : (var_1_23 == ((signed long int) ((var_1_10 + var_1_14) + var_1_24)))) : 1)) && ((var_1_10 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14))))) ? (var_1_24 == ((unsigned short int) ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))))) : (var_1_24 == ((unsigned short int) var_1_31)))) && (var_1_8 ? (var_1_26 == ((float) (var_1_19 + ((var_1_27 + var_1_28) + var_1_17)))) : (var_1_26 == ((float) ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))))))) && (((last_1_var_1_14 <= (last_1_var_1_14 * var_1_12)) && last_1_var_1_1) ? ((last_1_var_1_31 <= last_1_var_1_14) ? (((- var_1_19) >= var_1_17) ? (var_1_31 == ((unsigned char) (128 - ((((100) < ((var_1_33 + var_1_34))) ? (100) : ((var_1_33 + var_1_34))))))) : (var_1_31 == ((unsigned char) (var_1_35 - 5)))) : (var_1_31 == ((unsigned char) var_1_33))) : (var_1_31 == ((unsigned char) var_1_33))) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 164 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 1436 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 920 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 601 IncrementalHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 516 mSDtfsCounter, 601 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=3, InterpolantAutomatonStates: 19, 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, 4 MinimizatonAttempts, 219 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1319 NumberOfCodeBlocks, 1319 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 4044 SizeOfPredicates, 3 NumberOfNonLiveVariables, 799 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 5474/5520 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-17 03:01:59,139 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_loopvsstraightlinecode_100-1loop_file-17.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 86663a1cbbd8911dd5f20f51fde174aa6fa49f328dd842d1c9d2dbaf89183ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:02:01,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:02:01,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:02:01,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:02:01,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:02:01,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:02:01,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:02:01,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:02:01,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:02:01,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:02:01,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:02:01,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:02:01,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:02:01,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:02:01,156 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:02:01,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:02:01,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:02:01,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:02:01,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:02:01,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:02:01,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:02:01,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:02:01,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:02:01,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:02:01,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:02:01,158 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:02:01,158 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:02:01,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:02:01,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:02:01,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:02:01,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:02:01,158 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 -> 86663a1cbbd8911dd5f20f51fde174aa6fa49f328dd842d1c9d2dbaf89183ee7 [2025-03-17 03:02:01,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:02:01,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:02:01,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:02:01,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:02:01,425 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:02:01,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-03-17 03:02:02,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb76c5cd/72b26fa22bf64fcfb7481945c548bbf5/FLAG5fe92c163 [2025-03-17 03:02:02,841 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:02:02,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-03-17 03:02:02,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb76c5cd/72b26fa22bf64fcfb7481945c548bbf5/FLAG5fe92c163 [2025-03-17 03:02:02,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb76c5cd/72b26fa22bf64fcfb7481945c548bbf5 [2025-03-17 03:02:02,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:02:02,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:02:02,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:02:02,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:02:02,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:02:02,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:02" (1/1) ... [2025-03-17 03:02:02,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649e2f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:02, skipping insertion in model container [2025-03-17 03:02:02,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:02" (1/1) ... [2025-03-17 03:02:02,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:02:03,014 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_loopvsstraightlinecode_100-1loop_file-17.i[916,929] [2025-03-17 03:02:03,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:02:03,094 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:02:03,102 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_loopvsstraightlinecode_100-1loop_file-17.i[916,929] [2025-03-17 03:02:03,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:02:03,156 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:02:03,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03 WrapperNode [2025-03-17 03:02:03,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:02:03,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:02:03,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:02:03,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:02:03,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,199 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-17 03:02:03,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:02:03,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:02:03,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:02:03,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:02:03,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,218 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-17 03:02:03,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:02:03,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:02:03,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:02:03,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:02:03,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (1/1) ... [2025-03-17 03:02:03,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:02:03,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:02:03,276 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-17 03:02:03,282 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-17 03:02:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:02:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:02:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:02:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:02:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:02:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:02:03,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:02:03,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:02:15,795 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 03:02:15,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:02:15,803 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:02:15,804 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:02:15,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:15 BoogieIcfgContainer [2025-03-17 03:02:15,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:02:15,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:02:15,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:02:15,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:02:15,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:02:02" (1/3) ... [2025-03-17 03:02:15,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd16d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:15, skipping insertion in model container [2025-03-17 03:02:15,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:03" (2/3) ... [2025-03-17 03:02:15,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd16d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:15, skipping insertion in model container [2025-03-17 03:02:15,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:15" (3/3) ... [2025-03-17 03:02:15,810 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-03-17 03:02:15,819 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:02:15,820 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-17.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:02:15,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:02:15,871 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;@518f137b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:02:15,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:02:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:02:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 03:02:15,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:15,884 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:15,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:15,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1196226571, now seen corresponding path program 1 times [2025-03-17 03:02:15,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:02:15,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183010916] [2025-03-17 03:02:15,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:15,911 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-17 03:02:15,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:02:15,913 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-17 03:02:15,914 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-17 03:02:15,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 03:02:16,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 03:02:16,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:16,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:16,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:02:16,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:02:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-03-17 03:02:16,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:02:16,713 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:02:16,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183010916] [2025-03-17 03:02:16,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183010916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:16,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:16,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:02:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413612558] [2025-03-17 03:02:16,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:16,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:02:16,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:02:16,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:02:16,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:02:16,736 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:02:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:16,757 INFO L93 Difference]: Finished difference Result 147 states and 251 transitions. [2025-03-17 03:02:16,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:02:16,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2025-03-17 03:02:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:16,763 INFO L225 Difference]: With dead ends: 147 [2025-03-17 03:02:16,763 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 03:02:16,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-17 03:02:16,767 INFO L435 NwaCegarLoop]: 112 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, 112 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-17 03:02:16,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:02:16,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 03:02:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 03:02:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:02:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2025-03-17 03:02:16,798 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 157 [2025-03-17 03:02:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:16,798 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2025-03-17 03:02:16,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:02:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2025-03-17 03:02:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 03:02:16,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:16,801 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:16,832 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-17 03:02:17,001 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-17 03:02:17,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:17,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash 792985893, now seen corresponding path program 1 times [2025-03-17 03:02:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:02:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465427373] [2025-03-17 03:02:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:17,003 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-17 03:02:17,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:02:17,006 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-17 03:02:17,007 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-17 03:02:17,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 03:02:17,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 03:02:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:17,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:02:17,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:02:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:02:23,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:02:23,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:02:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465427373] [2025-03-17 03:02:23,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465427373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:02:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006734936] [2025-03-17 03:02:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:23,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:02:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:02:23,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:02:23,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:02:23,244 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:02:28,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:32,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:36,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:40,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:44,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:48,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:48,970 INFO L93 Difference]: Finished difference Result 215 states and 329 transitions. [2025-03-17 03:02:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:02:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-03-17 03:02:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:49,068 INFO L225 Difference]: With dead ends: 215 [2025-03-17 03:02:49,068 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 03:02:49,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:02:49,069 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 67 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 49 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:49,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 359 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time] [2025-03-17 03:02:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 03:02:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2025-03-17 03:02:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:02:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2025-03-17 03:02:49,095 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 157 [2025-03-17 03:02:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:49,095 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2025-03-17 03:02:49,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:02:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2025-03-17 03:02:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 03:02:49,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:49,098 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:49,127 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-17 03:02:49,298 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-17 03:02:49,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:49,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1674142812, now seen corresponding path program 1 times [2025-03-17 03:02:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:02:49,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046464647] [2025-03-17 03:02:49,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:49,301 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-17 03:02:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:02:49,304 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-17 03:02:49,305 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-17 03:02:49,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 03:02:50,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 03:02:50,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:50,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:50,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:02:50,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:02:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:02:57,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:02:57,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:02:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046464647] [2025-03-17 03:02:57,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046464647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:57,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:57,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:02:57,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784197824] [2025-03-17 03:02:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:57,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:02:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:02:57,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:02:57,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:02:57,191 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:03:02,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:03:06,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:03:11,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:03:15,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:03:19,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:03:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:19,406 INFO L93 Difference]: Finished difference Result 260 states and 397 transitions. [2025-03-17 03:03:19,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:03:19,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2025-03-17 03:03:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:19,501 INFO L225 Difference]: With dead ends: 260 [2025-03-17 03:03:19,501 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 03:03:19,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:03:19,502 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 161 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:19,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 461 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 21.8s Time] [2025-03-17 03:03:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 03:03:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 127. [2025-03-17 03:03:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:03:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2025-03-17 03:03:19,522 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 158 [2025-03-17 03:03:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:19,523 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2025-03-17 03:03:19,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:03:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2025-03-17 03:03:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 03:03:19,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:19,528 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:19,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 03:03:19,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:03:19,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1219392294, now seen corresponding path program 1 times [2025-03-17 03:03:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:03:19,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762061040] [2025-03-17 03:03:19,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:19,729 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-17 03:03:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:03:19,733 INFO L229 MonitoredProcess]: Starting monitored process 5 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-17 03:03:19,733 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 (5)] Waiting until timeout for monitored process [2025-03-17 03:03:19,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 03:03:20,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 03:03:20,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:20,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:20,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 03:03:20,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:03:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:03:31,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:03:31,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:03:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762061040] [2025-03-17 03:03:31,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762061040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:31,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:31,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:03:31,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966006276] [2025-03-17 03:03:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:31,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:03:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:03:31,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:03:31,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:03:31,489 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)