./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.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 497d15388e034a149c78194db219807046ee74564c7ab7b99d1dbd873759d869 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:57:36,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:57:36,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:57:36,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:57:36,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:57:36,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:57:36,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:57:36,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:57:36,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:57:36,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:57:36,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:57:36,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:57:36,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:57:36,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:57:36,416 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:57:36,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:57:36,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:57:36,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:57:36,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:57:36,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:57:36,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:57:36,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:36,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:57:36,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:57:36,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:57:36,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:57:36,419 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 -> 497d15388e034a149c78194db219807046ee74564c7ab7b99d1dbd873759d869 [2025-03-03 23:57:36,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:57:36,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:57:36,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:57:36,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:57:36,621 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:57:36,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i [2025-03-03 23:57:37,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deaab8aec/12a5f0252e19487faa068111962171cc/FLAGc1f5831fe [2025-03-03 23:57:37,954 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:57:37,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i [2025-03-03 23:57:37,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deaab8aec/12a5f0252e19487faa068111962171cc/FLAGc1f5831fe [2025-03-03 23:57:37,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deaab8aec/12a5f0252e19487faa068111962171cc [2025-03-03 23:57:37,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:57:37,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:57:37,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:37,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:57:37,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:57:37,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:37" (1/1) ... [2025-03-03 23:57:37,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1216c2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:37, skipping insertion in model container [2025-03-03 23:57:37,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:37" (1/1) ... [2025-03-03 23:57:38,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:57:38,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i[916,929] [2025-03-03 23:57:38,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:38,210 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:57:38,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i[916,929] [2025-03-03 23:57:38,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:38,260 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:57:38,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38 WrapperNode [2025-03-03 23:57:38,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:38,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:38,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:57:38,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:57:38,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,308 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2025-03-03 23:57:38,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:38,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:57:38,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:57:38,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:57:38,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:57:38,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,349 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:57:38,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:57:38,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:57:38,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:57:38,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (1/1) ... [2025-03-03 23:57:38,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:38,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:38,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:57:38,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:57:38,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:57:38,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:57:38,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:57:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:57:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:57:38,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:57:38,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:57:38,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:57:38,839 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-03 23:57:38,839 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:57:38,846 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:57:38,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:57:38,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:38 BoogieIcfgContainer [2025-03-03 23:57:38,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:57:38,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:57:38,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:57:38,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:57:38,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:57:37" (1/3) ... [2025-03-03 23:57:38,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bca486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:38, skipping insertion in model container [2025-03-03 23:57:38,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:38" (2/3) ... [2025-03-03 23:57:38,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bca486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:38, skipping insertion in model container [2025-03-03 23:57:38,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:38" (3/3) ... [2025-03-03 23:57:38,855 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-62.i [2025-03-03 23:57:38,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:57:38,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-62.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:57:38,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:57:38,916 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;@7b2a45f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:57:38,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:57:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:57:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 23:57:38,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:38,928 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:38,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:38,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash -681361118, now seen corresponding path program 1 times [2025-03-03 23:57:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652869378] [2025-03-03 23:57:38,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:39,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:57:39,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:57:39,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:39,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 23:57:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652869378] [2025-03-03 23:57:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652869378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989516927] [2025-03-03 23:57:39,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:39,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:39,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:39,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:57:39,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:57:39,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:57:39,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:57:39,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:39,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:39,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:57:39,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 23:57:39,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:57:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989516927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:39,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:57:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:57:39,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005777351] [2025-03-03 23:57:39,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:39,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:57:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:39,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:57:39,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:39,425 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 23:57:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:39,446 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2025-03-03 23:57:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:57:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2025-03-03 23:57:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:39,452 INFO L225 Difference]: With dead ends: 174 [2025-03-03 23:57:39,452 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 23:57:39,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:39,456 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:39,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 23:57:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 23:57:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:57:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2025-03-03 23:57:39,483 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 191 [2025-03-03 23:57:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:39,484 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2025-03-03 23:57:39,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 23:57:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2025-03-03 23:57:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 23:57:39,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:39,488 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:39,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:57:39,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:57:39,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:39,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1738854044, now seen corresponding path program 1 times [2025-03-03 23:57:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547711706] [2025-03-03 23:57:39,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:39,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:57:39,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:57:39,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:39,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 23:57:39,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:39,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547711706] [2025-03-03 23:57:39,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547711706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:39,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:39,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:57:39,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846633558] [2025-03-03 23:57:39,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:39,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:57:39,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:39,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:57:39,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:39,926 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 23:57:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:39,989 INFO L93 Difference]: Finished difference Result 206 states and 316 transitions. [2025-03-03 23:57:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:57:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-03 23:57:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:39,992 INFO L225 Difference]: With dead ends: 206 [2025-03-03 23:57:39,992 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 23:57:39,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:39,993 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 47 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:39,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 296 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 23:57:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2025-03-03 23:57:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 82 states have internal predecessors, (110), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 23:57:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2025-03-03 23:57:40,006 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 191 [2025-03-03 23:57:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:40,007 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2025-03-03 23:57:40,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 23:57:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2025-03-03 23:57:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 23:57:40,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:40,009 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:40,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:57:40,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:40,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash -231302235, now seen corresponding path program 1 times [2025-03-03 23:57:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:40,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196135270] [2025-03-03 23:57:40,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:40,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:57:40,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:57:40,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:40,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 23:57:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196135270] [2025-03-03 23:57:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196135270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:41,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:41,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:57:41,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609544798] [2025-03-03 23:57:41,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:41,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:57:41,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:41,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:57:41,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:57:41,287 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 23:57:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:41,642 INFO L93 Difference]: Finished difference Result 342 states and 523 transitions. [2025-03-03 23:57:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:57:41,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-03 23:57:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:41,646 INFO L225 Difference]: With dead ends: 342 [2025-03-03 23:57:41,646 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 23:57:41,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:57:41,648 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 82 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:41,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 442 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:57:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 23:57:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 179. [2025-03-03 23:57:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 65 states have call successors, (65), 3 states have call predecessors, (65), 3 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 23:57:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 273 transitions. [2025-03-03 23:57:41,684 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 273 transitions. Word has length 191 [2025-03-03 23:57:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:41,685 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 273 transitions. [2025-03-03 23:57:41,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 23:57:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 273 transitions. [2025-03-03 23:57:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 23:57:41,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:41,689 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:41,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:57:41,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:41,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash -127412187, now seen corresponding path program 1 times [2025-03-03 23:57:41,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:41,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119957961] [2025-03-03 23:57:41,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:41,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 23:57:41,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 23:57:41,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:41,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 23:57:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119957961] [2025-03-03 23:57:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119957961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531534707] [2025-03-03 23:57:42,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:42,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:42,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:42,026 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:57:42,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:57:42,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 23:57:42,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 23:57:42,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:42,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:42,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:57:42,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2025-03-03 23:57:42,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:57:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 23:57:42,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531534707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:57:42,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:57:42,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 23:57:42,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663230037] [2025-03-03 23:57:42,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:57:42,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:57:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:42,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:57:42,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:57:42,645 INFO L87 Difference]: Start difference. First operand 179 states and 273 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-03 23:57:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:42,854 INFO L93 Difference]: Finished difference Result 282 states and 418 transitions. [2025-03-03 23:57:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:57:42,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 192 [2025-03-03 23:57:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:42,856 INFO L225 Difference]: With dead ends: 282 [2025-03-03 23:57:42,856 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 23:57:42,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:57:42,858 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 52 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:42,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 257 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:57:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 23:57:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2025-03-03 23:57:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 92 states have internal predecessors, (112), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 23:57:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions. [2025-03-03 23:57:42,886 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 192 [2025-03-03 23:57:42,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:42,886 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 232 transitions. [2025-03-03 23:57:42,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-03 23:57:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions. [2025-03-03 23:57:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 23:57:42,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:42,888 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:42,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:57:43,091 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-03 23:57:43,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:43,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash 756951590, now seen corresponding path program 1 times [2025-03-03 23:57:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637752996] [2025-03-03 23:57:43,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:43,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 23:57:43,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 23:57:43,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 23:57:43,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:43,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637752996] [2025-03-03 23:57:43,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637752996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:43,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183227249] [2025-03-03 23:57:43,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:43,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:43,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:43,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:57:43,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:57:43,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 23:57:43,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 23:57:43,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:43,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:43,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:57:43,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 23:57:43,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:57:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 23:57:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183227249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:57:43,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:57:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 23:57:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407494943] [2025-03-03 23:57:43,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:57:43,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:57:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:43,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:57:43,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:57:43,789 INFO L87 Difference]: Start difference. First operand 158 states and 232 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 23:57:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:43,944 INFO L93 Difference]: Finished difference Result 271 states and 385 transitions. [2025-03-03 23:57:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:57:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 193 [2025-03-03 23:57:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:43,946 INFO L225 Difference]: With dead ends: 271 [2025-03-03 23:57:43,946 INFO L226 Difference]: Without dead ends: 178 [2025-03-03 23:57:43,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:57:43,947 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:43,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 222 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:57:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-03 23:57:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2025-03-03 23:57:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 98 states have (on average 1.183673469387755) internal successors, (116), 98 states have internal predecessors, (116), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 23:57:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2025-03-03 23:57:43,973 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 193 [2025-03-03 23:57:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:43,974 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2025-03-03 23:57:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 23:57:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2025-03-03 23:57:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 23:57:43,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:43,976 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:43,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:57:44,176 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-03 23:57:44,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:44,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1885077445, now seen corresponding path program 1 times [2025-03-03 23:57:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:44,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709852755] [2025-03-03 23:57:44,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:44,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 23:57:44,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 23:57:44,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:44,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 23:57:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709852755] [2025-03-03 23:57:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709852755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520466514] [2025-03-03 23:57:44,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:44,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:44,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:44,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:57:44,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:57:44,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 23:57:44,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 23:57:44,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:44,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:44,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:57:44,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 683 proven. 126 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-03-03 23:57:44,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:57:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 23:57:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520466514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:57:45,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:57:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-03-03 23:57:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640302498] [2025-03-03 23:57:45,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:57:45,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:57:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:45,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:57:45,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:57:45,021 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-03 23:57:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:45,260 INFO L93 Difference]: Finished difference Result 291 states and 397 transitions. [2025-03-03 23:57:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:57:45,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 194 [2025-03-03 23:57:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:45,262 INFO L225 Difference]: With dead ends: 291 [2025-03-03 23:57:45,262 INFO L226 Difference]: Without dead ends: 194 [2025-03-03 23:57:45,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:57:45,263 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 159 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:45,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 360 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:57:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-03 23:57:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2025-03-03 23:57:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 60 states have call successors, (60), 11 states have call predecessors, (60), 11 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 23:57:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 245 transitions. [2025-03-03 23:57:45,282 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 245 transitions. Word has length 194 [2025-03-03 23:57:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:45,282 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 245 transitions. [2025-03-03 23:57:45,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-03 23:57:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 245 transitions. [2025-03-03 23:57:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 23:57:45,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:45,284 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:45,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 23:57:45,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:45,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:45,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:45,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1444412893, now seen corresponding path program 1 times [2025-03-03 23:57:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:45,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706910686] [2025-03-03 23:57:45,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:45,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:45,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 23:57:45,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 23:57:45,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:45,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:57:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978383766] [2025-03-03 23:57:45,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:45,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:45,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:45,617 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:57:45,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 23:57:45,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 23:57:45,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 23:57:45,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:45,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:57:45,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:57:45,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 23:57:46,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 23:57:46,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:46,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:57:46,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:57:46,138 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:57:46,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:57:46,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 23:57:46,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:46,346 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:46,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:57:46,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:57:46 BoogieIcfgContainer [2025-03-03 23:57:46,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:57:46,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:57:46,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:57:46,433 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:57:46,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:38" (3/4) ... [2025-03-03 23:57:46,435 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:57:46,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:57:46,436 INFO L158 Benchmark]: Toolchain (without parser) took 8447.18ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 124.0MB in the beginning and 268.1MB in the end (delta: -144.1MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-03-03 23:57:46,436 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:57:46,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.36ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 106.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:57:46,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.98ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 102.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:57:46,436 INFO L158 Benchmark]: Boogie Preprocessor took 47.24ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 96.9MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:57:46,437 INFO L158 Benchmark]: IcfgBuilder took 488.00ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 69.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:57:46,437 INFO L158 Benchmark]: TraceAbstraction took 7582.63ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 68.0MB in the beginning and 268.2MB in the end (delta: -200.1MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2025-03-03 23:57:46,437 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 377.5MB. Free memory was 268.2MB in the beginning and 268.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:57:46,438 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.19ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.36ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 106.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.98ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 102.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.24ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 96.9MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 488.00ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 69.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7582.63ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 68.0MB in the beginning and 268.2MB in the end (delta: -200.1MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 377.5MB. Free memory was 268.2MB in the beginning and 268.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 87, overapproximation of someBinaryArithmeticDOUBLEoperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 176, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of someUnaryDOUBLEoperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 32.2; [L23] double var_1_4 = 10000000.9; [L24] double var_1_5 = 32.46; [L25] double var_1_6 = 10000.6; [L26] unsigned long int var_1_7 = 128; [L27] unsigned long int var_1_9 = 1; [L28] unsigned long int var_1_10 = 10000; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 1; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 63.8; [L35] double var_1_18 = 64.125; [L36] double var_1_19 = 0.9; [L37] float var_1_20 = 8.8; [L38] float var_1_21 = 999999999999.75; [L39] float var_1_22 = 127.5; [L40] unsigned long int var_1_23 = 25; [L41] float var_1_24 = 127.75; [L42] float var_1_25 = 64.7; [L43] signed char var_1_26 = -128; [L44] signed char var_1_27 = 64; [L45] signed char var_1_28 = -16; [L46] signed char var_1_29 = -2; [L47] unsigned short int var_1_30 = 4; [L48] unsigned short int var_1_31 = 57679; [L49] unsigned short int var_1_32 = 23164; [L50] unsigned short int var_1_33 = 1; [L51] double last_1_var_1_1 = 32.2; [L52] unsigned long int last_1_var_1_7 = 128; [L53] unsigned long int last_1_var_1_9 = 1; [L54] unsigned short int last_1_var_1_30 = 4; VAL [isInitial=0, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_7 = var_1_7 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L147] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L148] var_1_5 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L149] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L150] var_1_6 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L151] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L152] var_1_10 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L154] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L156] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L157] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L161] var_1_15 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L162] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L163] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L164] var_1_16 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L165] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L166] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L167] var_1_18 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L168] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L169] var_1_19 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_19 >= 0.0F && 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_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L170] RET assume_abort_if_not((var_1_19 >= 0.0F && 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_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L171] var_1_23 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L172] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L173] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L173] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L174] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L176] RET assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L178] RET assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L179] var_1_27 = __VERIFIER_nondet_char() [L180] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L180] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L181] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L182] var_1_29 = __VERIFIER_nondet_char() [L183] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L183] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L184] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L185] var_1_31 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_31 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L186] RET assume_abort_if_not(var_1_31 >= 32767) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L187] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L188] var_1_32 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_32 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=1, var_1_7=128, var_1_9=1] [L189] RET assume_abort_if_not(var_1_32 >= 16383) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=1, var_1_7=128, var_1_9=1] [L190] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=1, var_1_7=128, var_1_9=1] [L190] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=1, var_1_7=128, var_1_9=1] [L191] var_1_33 = __VERIFIER_nondet_ushort() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_7=128, var_1_9=1] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_7=128, var_1_9=1] [L193] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=1] [L193] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=1] [L210] RET updateVariables() [L211] CALL step() [L58] unsigned char stepLocal_8 = var_1_14; [L59] unsigned char stepLocal_7 = var_1_14; [L60] unsigned short int stepLocal_6 = var_1_32; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16384, stepLocal_7=1, stepLocal_8=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=1] [L61] COND FALSE !(stepLocal_7 && var_1_16) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16384, stepLocal_8=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=1] [L64] COND TRUE (var_1_13 && (last_1_var_1_1 > 64.177)) || stepLocal_8 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16384, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=1] [L65] COND TRUE var_1_10 >= stepLocal_6 [L66] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=1] [L74] var_1_9 = (((((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) < (last_1_var_1_30)) ? ((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) : (last_1_var_1_30))) [L75] unsigned long int stepLocal_2 = var_1_9 - var_1_30; [L76] unsigned long int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_1=4, stepLocal_2=-3, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=4] [L77] COND TRUE 32 > stepLocal_1 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_2=-3, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=128, var_1_9=4] [L78] COND TRUE (- var_1_30) != stepLocal_2 [L79] var_1_7 = ((((((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) < (var_1_30)) ? (((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) : (var_1_30))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=5, var_1_9=4] [L86] COND TRUE \read(var_1_13) [L87] var_1_17 = ((var_1_18 - var_1_19) + var_1_4) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=5, var_1_9=4] [L91] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_7=5, var_1_9=4] [L92] COND TRUE var_1_5 > var_1_18 [L93] var_1_21 = ((((var_1_18) < (var_1_6)) ? (var_1_18) : (var_1_6))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=161/5, var_1_20=44/5, var_1_21=2, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_6=0, var_1_7=5, var_1_9=4] [L98] signed long int stepLocal_4 = ~ var_1_30; [L99] unsigned short int stepLocal_3 = var_1_30; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=7, stepLocal_4=-8, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=161/5, var_1_20=44/5, var_1_21=2, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_6=0, var_1_7=5, var_1_9=4] [L100] COND FALSE !((var_1_30 / var_1_23) == stepLocal_4) [L105] var_1_22 = 7.5f VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=7, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=161/5, var_1_20=44/5, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_6=0, var_1_7=5, var_1_9=4] [L107] unsigned short int stepLocal_5 = var_1_30; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=7, stepLocal_5=7, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=161/5, var_1_20=44/5, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_6=0, var_1_7=5, var_1_9=4] [L108] COND FALSE !(var_1_18 > var_1_24) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=7, stepLocal_5=7, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=161/5, var_1_20=44/5, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_6=0, var_1_7=5, var_1_9=4] [L115] unsigned long int stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_0=4, stepLocal_3=7, stepLocal_5=7, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=161/5, var_1_20=44/5, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_6=0, var_1_7=5, var_1_9=4] [L116] COND TRUE var_1_30 >= stepLocal_0 [L117] var_1_1 = ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) < 0 ) ? -(((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=7, stepLocal_5=7, var_1_10=16385, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=3, var_1_20=44/5, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_6=0, var_1_7=5, var_1_9=4] [L121] COND TRUE var_1_4 <= (var_1_21 + (var_1_5 * var_1_6)) [L122] var_1_12 = ((var_1_13 && var_1_14) && var_1_15) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=7, stepLocal_5=7, var_1_10=16385, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=3, var_1_20=44/5, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_6=0, var_1_7=5, var_1_9=4] [L126] COND TRUE (var_1_30 == var_1_30) || var_1_12 [L127] var_1_20 = ((((25.5f) < (var_1_4)) ? (25.5f) : (var_1_4))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=7, stepLocal_5=7, var_1_10=16385, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=3, var_1_20=51/2, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L129] COND FALSE !(var_1_1 > (var_1_20 * (var_1_24 / 2.8))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=7, stepLocal_5=7, var_1_10=16385, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=3, var_1_20=51/2, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L211] RET step() [L212] CALL, EXPR property() [L202-L203] return (((((((((((var_1_30 >= var_1_9) ? (var_1_1 == ((double) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) < 0 ) ? -(((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6))))) : (var_1_1 == ((double) (var_1_4 + var_1_5)))) && ((32 > var_1_9) ? (((- var_1_30) != (var_1_9 - var_1_30)) ? (var_1_7 == ((unsigned long int) ((((((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) < (var_1_30)) ? (((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) : (var_1_30))))) : (var_1_7 == ((unsigned long int) var_1_9))) : (var_1_7 == ((unsigned long int) var_1_9)))) && (var_1_9 == ((unsigned long int) (((((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) < (last_1_var_1_30)) ? ((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) : (last_1_var_1_30)))))) && ((var_1_4 <= (var_1_21 + (var_1_5 * var_1_6))) ? (var_1_12 == ((unsigned char) ((var_1_13 && var_1_14) && var_1_15))) : (var_1_12 == ((unsigned char) var_1_16)))) && (var_1_13 ? (var_1_17 == ((double) ((var_1_18 - var_1_19) + var_1_4))) : (var_1_17 == ((double) var_1_6)))) && (((var_1_30 == var_1_30) || var_1_12) ? (var_1_20 == ((float) ((((25.5f) < (var_1_4)) ? (25.5f) : (var_1_4))))) : 1)) && (var_1_13 ? ((var_1_5 > var_1_18) ? (var_1_21 == ((float) ((((var_1_18) < (var_1_6)) ? (var_1_18) : (var_1_6))))) : 1) : (var_1_21 == ((float) (var_1_5 + (1.55f + 5.7f)))))) && (((var_1_30 / var_1_23) == (~ var_1_30)) ? (((var_1_30 + (- var_1_30)) >= var_1_30) ? (var_1_22 == ((float) ((var_1_24 + var_1_25) + (var_1_18 - ((((31.85f) > (10.5f)) ? (31.85f) : (10.5f))))))) : 1) : (var_1_22 == ((float) 7.5f)))) && ((var_1_1 > (var_1_20 * (var_1_24 / 2.8))) ? (var_1_14 ? (var_1_13 ? (var_1_26 == ((signed char) ((((var_1_27) > (0)) ? (var_1_27) : (0))))) : (var_1_16 ? (var_1_26 == ((signed char) var_1_27)) : (var_1_26 == ((signed char) var_1_27)))) : (var_1_26 == ((signed char) var_1_27))) : 1)) && ((var_1_18 > var_1_24) ? ((var_1_23 <= var_1_30) ? (var_1_28 == ((signed char) ((((var_1_27) > (var_1_29)) ? (var_1_27) : (var_1_29))))) : (var_1_28 == ((signed char) var_1_29))) : 1)) && ((var_1_14 && var_1_16) ? (var_1_30 == ((unsigned short int) (var_1_31 - ((((var_1_32 - var_1_33) < 0 ) ? -(var_1_32 - var_1_33) : (var_1_32 - var_1_33)))))) : (((var_1_13 && (last_1_var_1_1 > 64.177)) || var_1_14) ? ((var_1_10 >= var_1_32) ? (var_1_30 == ((unsigned short int) var_1_33)) : ((! (last_1_var_1_9 >= var_1_27)) ? (var_1_30 == ((unsigned short int) var_1_33)) : 1)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=3, var_1_20=51/2, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=3, var_1_20=51/2, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16385, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=2, var_1_1=3, var_1_20=51/2, var_1_21=2, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=7, var_1_31=32767, var_1_32=16384, var_1_33=7, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 1712 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 978 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 795 IncrementalHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 734 mSDtfsCounter, 795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1385 GetRequests, 1341 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2312 NumberOfCodeBlocks, 2312 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2488 ConstructedInterpolants, 0 QuantifiedInterpolants, 6015 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1794 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 21935/22620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:57:46,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.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 497d15388e034a149c78194db219807046ee74564c7ab7b99d1dbd873759d869 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:57:48,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:57:48,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:57:48,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:57:48,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:57:48,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:57:48,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:57:48,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:57:48,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:57:48,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:57:48,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:57:48,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:57:48,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:57:48,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:57:48,304 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:57:48,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:57:48,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:57:48,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:57:48,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:57:48,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:57:48,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:57:48,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:57:48,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:57:48,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:57:48,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:48,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:57:48,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:57:48,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:57:48,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:57:48,307 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:57:48,307 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:57:48,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:57:48,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:57:48,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:57:48,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:57:48,307 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 -> 497d15388e034a149c78194db219807046ee74564c7ab7b99d1dbd873759d869 [2025-03-03 23:57:48,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:57:48,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:57:48,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:57:48,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:57:48,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:57:48,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i [2025-03-03 23:57:49,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2b498d0/74018cdb9e3944058c2b2b3b0df8bf59/FLAG9b5b81513 [2025-03-03 23:57:49,895 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:57:49,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i [2025-03-03 23:57:49,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2b498d0/74018cdb9e3944058c2b2b3b0df8bf59/FLAG9b5b81513 [2025-03-03 23:57:50,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2b498d0/74018cdb9e3944058c2b2b3b0df8bf59 [2025-03-03 23:57:50,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:57:50,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:57:50,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:50,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:57:50,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:57:50,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c004485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50, skipping insertion in model container [2025-03-03 23:57:50,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:57:50,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i[916,929] [2025-03-03 23:57:50,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:50,471 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:57:50,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i[916,929] [2025-03-03 23:57:50,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:50,542 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:57:50,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50 WrapperNode [2025-03-03 23:57:50,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:50,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:50,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:57:50,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:57:50,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,581 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-03 23:57:50,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:50,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:57:50,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:57:50,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:57:50,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,604 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:57:50,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:57:50,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:57:50,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:57:50,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:57:50,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (1/1) ... [2025-03-03 23:57:50,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:50,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:50,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:57:50,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:57:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:57:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:57:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:57:50,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:57:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:57:50,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:57:50,730 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:57:50,732 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:58:21,818 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-03 23:58:21,818 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:58:21,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:58:21,825 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:58:21,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:58:21 BoogieIcfgContainer [2025-03-03 23:58:21,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:58:21,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:58:21,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:58:21,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:58:21,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:57:50" (1/3) ... [2025-03-03 23:58:21,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386b5c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:58:21, skipping insertion in model container [2025-03-03 23:58:21,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:50" (2/3) ... [2025-03-03 23:58:21,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386b5c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:58:21, skipping insertion in model container [2025-03-03 23:58:21,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:58:21" (3/3) ... [2025-03-03 23:58:21,833 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-62.i [2025-03-03 23:58:21,842 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:58:21,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-62.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:58:21,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:58:21,890 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;@3d45bcbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:58:21,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:58:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:58:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 23:58:21,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:21,922 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:21,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:21,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash -681361118, now seen corresponding path program 1 times [2025-03-03 23:58:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:58:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947431322] [2025-03-03 23:58:21,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:21,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:58:21,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:58:21,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:58:21,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:58:22,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:58:23,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:58:23,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:23,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:23,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:58:23,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2025-03-03 23:58:23,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:58:23,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:58:23,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947431322] [2025-03-03 23:58:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947431322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:58:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598060933] [2025-03-03 23:58:23,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:23,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:58:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:58:23,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:58:23,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:58:23,690 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 23:58:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:23,714 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2025-03-03 23:58:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:58:23,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2025-03-03 23:58:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:23,720 INFO L225 Difference]: With dead ends: 174 [2025-03-03 23:58:23,720 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 23:58:23,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:58:23,724 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:23,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:58:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 23:58:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 23:58:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:58:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2025-03-03 23:58:23,757 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 191 [2025-03-03 23:58:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:23,757 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2025-03-03 23:58:23,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 23:58:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2025-03-03 23:58:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 23:58:23,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:23,763 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:23,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:58:23,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:58:23,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:23,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1738854044, now seen corresponding path program 1 times [2025-03-03 23:58:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:58:23,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759476608] [2025-03-03 23:58:23,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:23,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:58:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:58:23,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:58:23,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:58:24,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:58:25,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:58:25,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:25,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:25,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:58:25,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 23:58:30,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 23:58:36,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:58:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759476608] [2025-03-03 23:58:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759476608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:36,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:58:36,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 23:58:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599822901] [2025-03-03 23:58:36,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:36,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:58:36,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:58:36,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:58:36,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:58:36,349 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 23:58:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:49,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:53,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:58,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.70s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:59:02,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:59:06,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:59:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:59:06,539 INFO L93 Difference]: Finished difference Result 179 states and 274 transitions. [2025-03-03 23:59:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:59:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 191 [2025-03-03 23:59:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:59:06,543 INFO L225 Difference]: With dead ends: 179 [2025-03-03 23:59:06,544 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 23:59:06,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:59:06,545 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 128 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 31 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:59:06,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 231 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 29.4s Time] [2025-03-03 23:59:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 23:59:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2025-03-03 23:59:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:59:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2025-03-03 23:59:06,557 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 191 [2025-03-03 23:59:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:59:06,558 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2025-03-03 23:59:06,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 23:59:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2025-03-03 23:59:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 23:59:06,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:59:06,560 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:59:06,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 23:59:06,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:59:06,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:59:06,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:59:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1308630333, now seen corresponding path program 1 times [2025-03-03 23:59:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:59:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805816284] [2025-03-03 23:59:06,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:59:06,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:59:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:59:06,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:59:06,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:59:06,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 23:59:08,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 23:59:08,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:59:08,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:59:08,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:59:08,515 INFO L279 TraceCheckSpWp]: Computing forward predicates...