./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.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_fillercode_fillercodesize_ps-cn-10_file-48.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 b65d479e18f7a591496f05b34aa32ff21e8b5e47f1165cd18eedfd85d0ebf4af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:36:59,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:36:59,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:36:59,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:36:59,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:36:59,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:36:59,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:36:59,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:36:59,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:36:59,912 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:36:59,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:36:59,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:36:59,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:36:59,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:36:59,914 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:36:59,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:36:59,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:36:59,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:36:59,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:36:59,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:36:59,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:36:59,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:36:59,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:36:59,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:36:59,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:36:59,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:36:59,917 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 -> b65d479e18f7a591496f05b34aa32ff21e8b5e47f1165cd18eedfd85d0ebf4af [2025-03-03 19:37:00,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:37:00,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:37:00,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:37:00,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:37:00,123 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:37:00,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2025-03-03 19:37:01,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0405389bc/9e4551cf99f242f18f1e46bd84cbc390/FLAG5e5ed91a7 [2025-03-03 19:37:01,423 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:37:01,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2025-03-03 19:37:01,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0405389bc/9e4551cf99f242f18f1e46bd84cbc390/FLAG5e5ed91a7 [2025-03-03 19:37:01,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0405389bc/9e4551cf99f242f18f1e46bd84cbc390 [2025-03-03 19:37:01,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:37:01,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:37:01,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:37:01,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:37:01,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:37:01,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:37:01" (1/1) ... [2025-03-03 19:37:01,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45756bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:01, skipping insertion in model container [2025-03-03 19:37:01,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:37:01" (1/1) ... [2025-03-03 19:37:01,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:37:01,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i[915,928] [2025-03-03 19:37:01,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:37:01,978 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:37:01,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i[915,928] [2025-03-03 19:37:02,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:37:02,019 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:37:02,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02 WrapperNode [2025-03-03 19:37:02,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:37:02,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:37:02,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:37:02,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:37:02,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,048 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-03-03 19:37:02,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:37:02,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:37:02,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:37:02,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:37:02,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,078 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 19:37:02,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:37:02,093 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:37:02,093 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:37:02,093 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:37:02,094 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (1/1) ... [2025-03-03 19:37:02,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:37:02,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:37:02,119 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 19:37:02,123 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 19:37:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:37:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:37:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:37:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:37:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:37:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:37:02,194 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:37:02,195 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:37:02,401 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 19:37:02,401 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:37:02,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:37:02,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:37:02,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:37:02 BoogieIcfgContainer [2025-03-03 19:37:02,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:37:02,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:37:02,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:37:02,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:37:02,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:37:01" (1/3) ... [2025-03-03 19:37:02,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc11d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:37:02, skipping insertion in model container [2025-03-03 19:37:02,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:02" (2/3) ... [2025-03-03 19:37:02,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc11d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:37:02, skipping insertion in model container [2025-03-03 19:37:02,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:37:02" (3/3) ... [2025-03-03 19:37:02,415 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2025-03-03 19:37:02,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:37:02,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-48.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:37:02,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:37:02,479 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;@2405da31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:37:02,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:37:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:37:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:37:02,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:02,493 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:37:02,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:02,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1046752219, now seen corresponding path program 1 times [2025-03-03 19:37:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129180579] [2025-03-03 19:37:02,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:02,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:37:02,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:37:02,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:02,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 19:37:02,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:37:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129180579] [2025-03-03 19:37:02,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129180579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:37:02,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097341978] [2025-03-03 19:37:02,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:02,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:37:02,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:37:02,727 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 19:37:02,728 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 19:37:02,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:37:02,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:37:02,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:02,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:02,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:37:02,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 19:37:02,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:37:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097341978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:02,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:37:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:37:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093457125] [2025-03-03 19:37:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:02,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:37:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:37:02,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:37:02,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:37:02,918 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:37:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:02,934 INFO L93 Difference]: Finished difference Result 141 states and 247 transitions. [2025-03-03 19:37:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:37:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-03-03 19:37:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:02,939 INFO L225 Difference]: With dead ends: 141 [2025-03-03 19:37:02,939 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 19:37:02,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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 19:37:02,944 INFO L435 NwaCegarLoop]: 106 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, 106 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 19:37:02,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:37:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 19:37:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 19:37:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:37:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 19:37:02,970 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 163 [2025-03-03 19:37:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:02,971 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 19:37:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:37:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 19:37:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:37:02,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:02,973 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:37:02,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:37:03,174 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 19:37:03,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:03,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:03,175 INFO L85 PathProgramCache]: Analyzing trace with hash -527518391, now seen corresponding path program 1 times [2025-03-03 19:37:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:03,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931757885] [2025-03-03 19:37:03,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:03,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:37:03,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:37:03,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:03,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:37:03,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:37:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931757885] [2025-03-03 19:37:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931757885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:37:03,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:37:03,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118916693] [2025-03-03 19:37:03,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:03,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:37:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:37:03,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:37:03,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:37:03,374 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:37:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:03,412 INFO L93 Difference]: Finished difference Result 155 states and 235 transitions. [2025-03-03 19:37:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:37:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-03-03 19:37:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:03,414 INFO L225 Difference]: With dead ends: 155 [2025-03-03 19:37:03,414 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 19:37:03,415 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 19:37:03,415 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:37:03,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 201 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:37:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 19:37:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2025-03-03 19:37:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:37:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2025-03-03 19:37:03,429 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 163 [2025-03-03 19:37:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:03,431 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2025-03-03 19:37:03,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:37:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2025-03-03 19:37:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:37:03,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:03,433 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:37:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:37:03,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:03,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:03,433 INFO L85 PathProgramCache]: Analyzing trace with hash -498889240, now seen corresponding path program 1 times [2025-03-03 19:37:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:03,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427608459] [2025-03-03 19:37:03,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:03,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:37:03,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:37:03,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:03,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:37:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:37:03,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427608459] [2025-03-03 19:37:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427608459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:03,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:37:03,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:37:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980297951] [2025-03-03 19:37:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:03,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:37:03,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:37:03,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:37:03,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:37:03,601 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:37:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:03,638 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2025-03-03 19:37:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:37:03,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-03-03 19:37:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:03,642 INFO L225 Difference]: With dead ends: 225 [2025-03-03 19:37:03,642 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 19:37:03,643 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 19:37:03,643 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:37:03,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:37:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 19:37:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2025-03-03 19:37:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 19:37:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2025-03-03 19:37:03,674 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 163 [2025-03-03 19:37:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:03,676 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2025-03-03 19:37:03,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:37:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2025-03-03 19:37:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 19:37:03,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:03,677 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:37:03,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:37:03,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:03,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1861204124, now seen corresponding path program 1 times [2025-03-03 19:37:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:03,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464812496] [2025-03-03 19:37:03,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:03,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:37:03,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:37:03,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:03,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:37:03,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:37:03,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:37:03,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:37:03,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:03,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:37:03,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:37:03,956 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:37:03,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:37:03,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:37:03,959 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 19:37:04,057 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:37:04,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:37:04 BoogieIcfgContainer [2025-03-03 19:37:04,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:37:04,060 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:37:04,060 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:37:04,060 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:37:04,061 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:37:02" (3/4) ... [2025-03-03 19:37:04,063 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:37:04,063 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:37:04,064 INFO L158 Benchmark]: Toolchain (without parser) took 2265.32ms. Allocated memory is still 201.3MB. Free memory was 159.6MB in the beginning and 133.4MB in the end (delta: 26.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2025-03-03 19:37:04,064 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:37:04,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.30ms. Allocated memory is still 201.3MB. Free memory was 159.6MB in the beginning and 144.9MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:37:04,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.21ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 141.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:37:04,064 INFO L158 Benchmark]: Boogie Preprocessor took 43.79ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 136.9MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:37:04,065 INFO L158 Benchmark]: IcfgBuilder took 315.48ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 114.8MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:37:04,065 INFO L158 Benchmark]: TraceAbstraction took 1650.07ms. Allocated memory is still 201.3MB. Free memory was 114.1MB in the beginning and 133.4MB in the end (delta: -19.3MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2025-03-03 19:37:04,065 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 133.4MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:37:04,066 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.41ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.30ms. Allocated memory is still 201.3MB. Free memory was 159.6MB in the beginning and 144.9MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.21ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 141.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.79ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 136.9MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 315.48ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 114.8MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1650.07ms. Allocated memory is still 201.3MB. Free memory was 114.1MB in the beginning and 133.4MB in the end (delta: -19.3MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 133.4MB in the end (delta: 33.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 someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned short int var_1_21 = 10; [L42] signed long int var_1_22 = -256; [L43] unsigned long int var_1_23 = 256; [L44] signed long int var_1_24 = 32; [L45] signed long int var_1_25 = 32; [L46] signed char var_1_26 = -10; [L47] signed char var_1_27 = 50; [L48] signed short int var_1_28 = 8; [L49] unsigned char last_1_var_1_8 = 5; [L50] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L167] isInitial = 1 [L168] FCALL initially() [L169] COND TRUE 1 [L170] CALL updateLastVariables() [L159] last_1_var_1_8 = var_1_8 [L160] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L170] RET updateLastVariables() [L171] CALL updateVariables() [L116] var_1_2 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L117] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L118] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L118] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L119] var_1_3 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L120] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L121] var_1_4 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L122] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L123] var_1_5 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L124] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L125] var_1_6 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L126] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L127] var_1_7 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_8=5, var_1_9=307/20] [L128] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_8=5, var_1_9=307/20] [L129] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L129] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L130] var_1_9 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L131] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L132] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L132] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L133] var_1_10 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L134] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L135] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L135] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L136] var_1_11 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L137] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L138] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L138] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L139] var_1_15 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L140] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L141] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L141] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L142] var_1_16 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L143] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L144] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L144] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L145] var_1_17 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L146] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L147] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L147] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L148] var_1_21 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L149] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L150] CALL assume_abort_if_not(var_1_21 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L150] RET assume_abort_if_not(var_1_21 <= 65534) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L151] var_1_25 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_25 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L152] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L153] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L153] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L154] var_1_27 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L155] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L156] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L156] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L171] RET updateVariables() [L172] CALL step() [L54] var_1_20 = var_1_21 [L55] var_1_22 = var_1_21 [L56] var_1_23 = var_1_21 [L57] var_1_24 = var_1_25 [L58] var_1_26 = var_1_27 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L59] COND TRUE var_1_26 >= -10 [L60] var_1_28 = ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_26)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_26))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=5] [L62] COND FALSE !(\read(var_1_2)) [L69] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=5] [L71] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=5] [L72] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L73] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L81] COND FALSE !(\read(var_1_2)) [L90] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L92] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=191, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L93] COND TRUE var_1_10 == stepLocal_1 [L94] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L98] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L101] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L104] COND FALSE !(last_1_var_1_18 != var_1_16) [L111] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=191, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L172] RET step() [L173] CALL, EXPR property() [L163-L164] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=191, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L173] RET, EXPR property() [L173] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=191, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=191, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 314 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 816 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 5150/5200 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 19:37:04,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.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 b65d479e18f7a591496f05b34aa32ff21e8b5e47f1165cd18eedfd85d0ebf4af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:37:05,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:37:05,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:37:05,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:37:05,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:37:05,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:37:05,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:37:05,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:37:05,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:37:05,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:37:05,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:37:05,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:37:05,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:37:05,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:37:05,905 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:37:05,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:37:05,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:37:05,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:37:05,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:37:05,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:37:05,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:37:05,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:37:05,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:37:05,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:37:05,908 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 -> b65d479e18f7a591496f05b34aa32ff21e8b5e47f1165cd18eedfd85d0ebf4af [2025-03-03 19:37:06,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:37:06,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:37:06,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:37:06,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:37:06,110 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:37:06,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2025-03-03 19:37:07,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27be9ed7c/17a2fb42f836451da2157ce93e240dce/FLAG5e23939ee [2025-03-03 19:37:07,383 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:37:07,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2025-03-03 19:37:07,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27be9ed7c/17a2fb42f836451da2157ce93e240dce/FLAG5e23939ee [2025-03-03 19:37:07,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27be9ed7c/17a2fb42f836451da2157ce93e240dce [2025-03-03 19:37:07,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:37:07,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:37:07,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:37:07,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:37:07,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:37:07,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:07,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e265e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07, skipping insertion in model container [2025-03-03 19:37:07,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:07,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:37:07,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i[915,928] [2025-03-03 19:37:07,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:37:07,934 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:37:07,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i[915,928] [2025-03-03 19:37:07,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:37:07,971 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:37:07,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07 WrapperNode [2025-03-03 19:37:07,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:37:07,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:37:07,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:37:07,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:37:07,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:07,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,020 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2025-03-03 19:37:08,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:37:08,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:37:08,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:37:08,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:37:08,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,046 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 19:37:08,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:37:08,061 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:37:08,061 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:37:08,061 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:37:08,062 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (1/1) ... [2025-03-03 19:37:08,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:37:08,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:37:08,091 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 19:37:08,094 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 19:37:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:37:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:37:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:37:08,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:37:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:37:08,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:37:08,176 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:37:08,178 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:37:34,026 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 19:37:34,027 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:37:34,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:37:34,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:37:34,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:37:34 BoogieIcfgContainer [2025-03-03 19:37:34,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:37:34,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:37:34,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:37:34,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:37:34,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:37:07" (1/3) ... [2025-03-03 19:37:34,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5746b704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:37:34, skipping insertion in model container [2025-03-03 19:37:34,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:07" (2/3) ... [2025-03-03 19:37:34,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5746b704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:37:34, skipping insertion in model container [2025-03-03 19:37:34,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:37:34" (3/3) ... [2025-03-03 19:37:34,042 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2025-03-03 19:37:34,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:37:34,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-48.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:37:34,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:37:34,101 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;@27ef94b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:37:34,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:37:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:37:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:37:34,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:34,115 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:37:34,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:34,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:34,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1046752219, now seen corresponding path program 1 times [2025-03-03 19:37:34,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:37:34,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013686224] [2025-03-03 19:37:34,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:34,128 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 19:37:34,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:37:34,130 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 19:37:34,131 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 19:37:34,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:37:35,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:37:35,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:35,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:35,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:37:35,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2025-03-03 19:37:35,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:37:35,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:37:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013686224] [2025-03-03 19:37:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013686224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:35,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:37:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:37:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389893808] [2025-03-03 19:37:35,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:35,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:37:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:37:35,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:37:35,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:37:35,585 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:37:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:35,609 INFO L93 Difference]: Finished difference Result 141 states and 247 transitions. [2025-03-03 19:37:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:37:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-03-03 19:37:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:35,616 INFO L225 Difference]: With dead ends: 141 [2025-03-03 19:37:35,617 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 19:37:35,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:37:35,622 INFO L435 NwaCegarLoop]: 106 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, 106 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 19:37:35,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:37:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 19:37:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 19:37:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:37:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 19:37:35,661 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 163 [2025-03-03 19:37:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:35,662 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 19:37:35,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:37:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 19:37:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:37:35,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:35,666 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:37:35,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:37:35,866 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 19:37:35,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:35,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:35,867 INFO L85 PathProgramCache]: Analyzing trace with hash -527518391, now seen corresponding path program 1 times [2025-03-03 19:37:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:37:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937260691] [2025-03-03 19:37:35,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:35,868 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 19:37:35,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:37:35,871 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 19:37:35,872 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 19:37:35,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:37:37,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:37:37,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:37,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:37,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:37:37,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:37:37,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:37:37,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:37:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937260691] [2025-03-03 19:37:37,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937260691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:37,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:37:37,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:37:37,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114802488] [2025-03-03 19:37:37,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:37,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:37:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:37:37,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:37:37,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:37:37,414 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:37:41,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:37:46,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:37:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:46,650 INFO L93 Difference]: Finished difference Result 155 states and 235 transitions. [2025-03-03 19:37:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:37:46,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-03-03 19:37:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:46,652 INFO L225 Difference]: With dead ends: 155 [2025-03-03 19:37:46,652 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 19:37:46,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:37:46,653 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 20 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:37:46,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-03-03 19:37:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 19:37:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2025-03-03 19:37:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:37:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2025-03-03 19:37:46,662 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 163 [2025-03-03 19:37:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:46,664 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2025-03-03 19:37:46,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:37:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2025-03-03 19:37:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:37:46,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:46,666 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:37:46,701 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 19:37:46,866 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 19:37:46,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:46,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash -498889240, now seen corresponding path program 1 times [2025-03-03 19:37:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:37:46,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922398301] [2025-03-03 19:37:46,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:46,867 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 19:37:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:37:46,869 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 19:37:46,870 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 19:37:46,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:37:48,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:37:48,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:48,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:48,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:37:48,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:37:53,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:37:53,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:37:53,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922398301] [2025-03-03 19:37:53,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922398301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:53,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:37:53,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:37:53,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657123789] [2025-03-03 19:37:53,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:53,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:37:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:37:53,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:37:53,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:37:53,977 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:37:58,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:38:02,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:38:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:03,186 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2025-03-03 19:38:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:38:03,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-03-03 19:38:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:03,190 INFO L225 Difference]: With dead ends: 225 [2025-03-03 19:38:03,191 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 19:38:03,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:38:03,192 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:03,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-03-03 19:38:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 19:38:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2025-03-03 19:38:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 19:38:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2025-03-03 19:38:03,209 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 163 [2025-03-03 19:38:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:03,210 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2025-03-03 19:38:03,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:38:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2025-03-03 19:38:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 19:38:03,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:03,211 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:38:03,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 19:38:03,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:38:03,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:03,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:03,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1861204124, now seen corresponding path program 1 times [2025-03-03 19:38:03,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:38:03,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72058064] [2025-03-03 19:38:03,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:03,413 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 19:38:03,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:38:03,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:38:03,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 19:38:03,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:38:04,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:38:04,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:04,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:04,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 19:38:04,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:38:19,684 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 19:38:27,509 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 19:38:35,999 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 19:38:44,155 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)