./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-25_file-9.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 e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:15:01,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:15:02,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:15:02,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:15:02,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:15:02,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:15:02,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:15:02,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:15:02,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:15:02,022 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:15:02,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:15:02,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:15:02,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:15:02,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:15:02,023 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:15:02,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:15:02,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:15:02,023 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:15:02,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:15:02,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:15:02,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:15:02,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:15:02,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:15:02,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:15:02,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:15:02,026 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 -> e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e [2025-03-08 11:15:02,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:15:02,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:15:02,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:15:02,253 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:15:02,253 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:15:02,254 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-25_file-9.i [2025-03-08 11:15:03,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d1a5bed/fe58a72f77f94c6788a4ffd7fa0a2561/FLAG256cb64bc [2025-03-08 11:15:03,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:15:03,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2025-03-08 11:15:03,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d1a5bed/fe58a72f77f94c6788a4ffd7fa0a2561/FLAG256cb64bc [2025-03-08 11:15:03,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d1a5bed/fe58a72f77f94c6788a4ffd7fa0a2561 [2025-03-08 11:15:03,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:15:03,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:15:03,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:15:03,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:15:03,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:15:03,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:15:03" (1/1) ... [2025-03-08 11:15:04,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c5f6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:03, skipping insertion in model container [2025-03-08 11:15:04,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:15:03" (1/1) ... [2025-03-08 11:15:04,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:15:04,106 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-25_file-9.i[914,927] [2025-03-08 11:15:04,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:15:04,177 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:15:04,185 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-25_file-9.i[914,927] [2025-03-08 11:15:04,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:15:04,216 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:15:04,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04 WrapperNode [2025-03-08 11:15:04,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:15:04,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:15:04,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:15:04,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:15:04,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,245 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 254 [2025-03-08 11:15:04,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:15:04,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:15:04,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:15:04,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:15:04,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,263 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-08 11:15:04,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:15:04,278 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:15:04,278 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:15:04,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:15:04,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (1/1) ... [2025-03-08 11:15:04,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:15:04,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:04,311 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-08 11:15:04,313 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-08 11:15:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:15:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:15:04,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:15:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:15:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:15:04,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:15:04,396 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:15:04,398 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:15:04,675 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-03-08 11:15:04,704 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-08 11:15:04,704 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:15:04,721 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:15:04,721 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:15:04,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:15:04 BoogieIcfgContainer [2025-03-08 11:15:04,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:15:04,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:15:04,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:15:04,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:15:04,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:15:03" (1/3) ... [2025-03-08 11:15:04,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11af6b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:15:04, skipping insertion in model container [2025-03-08 11:15:04,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:04" (2/3) ... [2025-03-08 11:15:04,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11af6b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:15:04, skipping insertion in model container [2025-03-08 11:15:04,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:15:04" (3/3) ... [2025-03-08 11:15:04,730 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2025-03-08 11:15:04,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:15:04,741 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:15:04,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:15:04,786 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;@186a82d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:15:04,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:15:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 11:15:04,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:04,801 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:04,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:04,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2100476036, now seen corresponding path program 1 times [2025-03-08 11:15:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:04,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992662152] [2025-03-08 11:15:04,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:04,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 11:15:04,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 11:15:04,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:04,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-08 11:15:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992662152] [2025-03-08 11:15:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992662152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678951769] [2025-03-08 11:15:05,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:05,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:05,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:05,071 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-08 11:15:05,073 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-08 11:15:05,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 11:15:05,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 11:15:05,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:05,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:05,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:15:05,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-08 11:15:05,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:15:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678951769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:05,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:15:05,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:15:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129605042] [2025-03-08 11:15:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:05,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:15:05,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:05,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:15:05,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:15:05,259 INFO L87 Difference]: Start difference. First operand has 108 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 11:15:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:05,285 INFO L93 Difference]: Finished difference Result 210 states and 355 transitions. [2025-03-08 11:15:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:15:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2025-03-08 11:15:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:05,292 INFO L225 Difference]: With dead ends: 210 [2025-03-08 11:15:05,292 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 11:15:05,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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-08 11:15:05,297 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:05,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:15:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 11:15:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-08 11:15:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2025-03-08 11:15:05,335 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 186 [2025-03-08 11:15:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:05,335 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2025-03-08 11:15:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 11:15:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2025-03-08 11:15:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 11:15:05,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:05,341 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:05,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:15:05,542 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-08 11:15:05,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:05,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash -568520456, now seen corresponding path program 1 times [2025-03-08 11:15:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368803622] [2025-03-08 11:15:05,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:05,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 11:15:05,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 11:15:05,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:05,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:05,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368803622] [2025-03-08 11:15:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368803622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:05,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:15:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831245212] [2025-03-08 11:15:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:05,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:15:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:05,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:15:05,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:15:05,796 INFO L87 Difference]: Start difference. First operand 105 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:05,846 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2025-03-08 11:15:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:15:05,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2025-03-08 11:15:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:05,848 INFO L225 Difference]: With dead ends: 208 [2025-03-08 11:15:05,848 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 11:15:05,849 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-08 11:15:05,853 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:05,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:15:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 11:15:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-08 11:15:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2025-03-08 11:15:05,867 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 162 transitions. Word has length 186 [2025-03-08 11:15:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:05,868 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 162 transitions. [2025-03-08 11:15:05,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 162 transitions. [2025-03-08 11:15:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:15:05,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:05,870 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:05,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:15:05,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:05,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1334526961, now seen corresponding path program 1 times [2025-03-08 11:15:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548218799] [2025-03-08 11:15:05,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:05,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:05,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:05,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:05,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548218799] [2025-03-08 11:15:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548218799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:09,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102458716] [2025-03-08 11:15:09,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:09,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:09,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:09,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:09,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:15:09,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:09,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:09,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:09,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:09,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 11:15:09,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 395 proven. 81 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-08 11:15:09,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:15:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102458716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:15:10,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:15:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2025-03-08 11:15:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002992291] [2025-03-08 11:15:10,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:15:10,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 11:15:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:10,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 11:15:10,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-08 11:15:10,216 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. Second operand has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 7 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 6 states have call predecessors, (84), 7 states have call successors, (84) [2025-03-08 11:15:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:12,275 INFO L93 Difference]: Finished difference Result 295 states and 438 transitions. [2025-03-08 11:15:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:15:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 7 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 6 states have call predecessors, (84), 7 states have call successors, (84) Word has length 187 [2025-03-08 11:15:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:12,278 INFO L225 Difference]: With dead ends: 295 [2025-03-08 11:15:12,278 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 11:15:12,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2025-03-08 11:15:12,282 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 883 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:12,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 455 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 11:15:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 11:15:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 114. [2025-03-08 11:15:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 167 transitions. [2025-03-08 11:15:12,296 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 167 transitions. Word has length 187 [2025-03-08 11:15:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:12,297 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 167 transitions. [2025-03-08 11:15:12,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 7 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 6 states have call predecessors, (84), 7 states have call successors, (84) [2025-03-08 11:15:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 167 transitions. [2025-03-08 11:15:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:15:12,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:12,299 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:12,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:15:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 11:15:12,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1845061138, now seen corresponding path program 1 times [2025-03-08 11:15:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519305984] [2025-03-08 11:15:12,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:12,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:12,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:12,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:12,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519305984] [2025-03-08 11:15:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519305984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237533308] [2025-03-08 11:15:14,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:14,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:14,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:14,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:15:14,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:14,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:14,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:14,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:14,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 11:15:14,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-08 11:15:15,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:15:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:16,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237533308] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:16,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:15:16,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 21 [2025-03-08 11:15:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602839035] [2025-03-08 11:15:16,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:16,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:15:16,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:16,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:15:16,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:15:16,308 INFO L87 Difference]: Start difference. First operand 114 states and 167 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:17,960 INFO L93 Difference]: Finished difference Result 399 states and 574 transitions. [2025-03-08 11:15:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:15:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2025-03-08 11:15:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:17,963 INFO L225 Difference]: With dead ends: 399 [2025-03-08 11:15:17,963 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 11:15:17,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:15:17,964 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 341 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:17,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 747 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 11:15:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 11:15:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 138. [2025-03-08 11:15:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2025-03-08 11:15:17,982 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 203 transitions. Word has length 187 [2025-03-08 11:15:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:17,983 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 203 transitions. [2025-03-08 11:15:17,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 203 transitions. [2025-03-08 11:15:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:15:17,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:17,984 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:17,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:15:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:18,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2042193572, now seen corresponding path program 1 times [2025-03-08 11:15:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834165124] [2025-03-08 11:15:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:18,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:18,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:18,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:18,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:19,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834165124] [2025-03-08 11:15:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834165124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834931947] [2025-03-08 11:15:19,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:19,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:19,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:19,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:19,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 11:15:19,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:20,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:20,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:20,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:20,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 11:15:20,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-08 11:15:20,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:15:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:21,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834931947] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:21,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:15:21,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 20 [2025-03-08 11:15:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494412186] [2025-03-08 11:15:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:21,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:15:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:21,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:15:21,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-08 11:15:21,419 INFO L87 Difference]: Start difference. First operand 138 states and 203 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:22,914 INFO L93 Difference]: Finished difference Result 427 states and 616 transitions. [2025-03-08 11:15:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:15:22,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2025-03-08 11:15:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:22,919 INFO L225 Difference]: With dead ends: 427 [2025-03-08 11:15:22,919 INFO L226 Difference]: Without dead ends: 292 [2025-03-08 11:15:22,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-08 11:15:22,921 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 335 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:22,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 715 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:15:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-08 11:15:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 140. [2025-03-08 11:15:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 108 states have internal predecessors, (150), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2025-03-08 11:15:22,938 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 187 [2025-03-08 11:15:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:22,939 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2025-03-08 11:15:22,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2025-03-08 11:15:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:15:22,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:22,940 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:22,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 11:15:23,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:23,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1605434287, now seen corresponding path program 1 times [2025-03-08 11:15:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:23,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033163420] [2025-03-08 11:15:23,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:23,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:23,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:23,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:23,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:23,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:25,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:25,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033163420] [2025-03-08 11:15:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033163420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861809769] [2025-03-08 11:15:25,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:25,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:25,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:25,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 11:15:25,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:25,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:25,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:25,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:25,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 11:15:25,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 460 proven. 264 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2025-03-08 11:15:26,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:15:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861809769] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:27,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:15:27,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 20] total 30 [2025-03-08 11:15:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223420459] [2025-03-08 11:15:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:27,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:15:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:27,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:15:27,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2025-03-08 11:15:27,802 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:30,256 INFO L93 Difference]: Finished difference Result 417 states and 604 transitions. [2025-03-08 11:15:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:15:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2025-03-08 11:15:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:30,258 INFO L225 Difference]: With dead ends: 417 [2025-03-08 11:15:30,258 INFO L226 Difference]: Without dead ends: 280 [2025-03-08 11:15:30,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 11:15:30,259 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 226 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:30,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 744 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 11:15:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-08 11:15:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 141. [2025-03-08 11:15:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 109 states have internal predecessors, (152), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2025-03-08 11:15:30,274 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 187 [2025-03-08 11:15:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:30,274 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2025-03-08 11:15:30,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2025-03-08 11:15:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:15:30,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:30,277 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:30,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 11:15:30,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:30,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:30,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1197721701, now seen corresponding path program 1 times [2025-03-08 11:15:30,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:30,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11130849] [2025-03-08 11:15:30,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:30,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:30,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:30,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:30,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11130849] [2025-03-08 11:15:31,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11130849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290686372] [2025-03-08 11:15:31,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:31,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:31,540 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:31,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 11:15:31,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:31,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:31,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:31,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:31,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 11:15:31,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:31,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:15:31,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290686372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:31,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:15:31,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-03-08 11:15:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182768776] [2025-03-08 11:15:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:31,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:15:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:31,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:15:31,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:15:31,752 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:31,936 INFO L93 Difference]: Finished difference Result 368 states and 533 transitions. [2025-03-08 11:15:31,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:15:31,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2025-03-08 11:15:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:31,940 INFO L225 Difference]: With dead ends: 368 [2025-03-08 11:15:31,940 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 11:15:31,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:15:31,941 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 107 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:31,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 565 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:15:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 11:15:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 140. [2025-03-08 11:15:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 108 states have internal predecessors, (150), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2025-03-08 11:15:31,955 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 187 [2025-03-08 11:15:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:31,955 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2025-03-08 11:15:31,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2025-03-08 11:15:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:15:31,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:31,957 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:31,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 11:15:32,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:32,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:32,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1633710225, now seen corresponding path program 1 times [2025-03-08 11:15:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:32,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36341053] [2025-03-08 11:15:32,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:32,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:32,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:32,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:32,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36341053] [2025-03-08 11:15:32,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36341053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842582819] [2025-03-08 11:15:32,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:32,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:32,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:32,946 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:32,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 11:15:32,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:33,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:33,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 11:15:33,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-08 11:15:33,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:15:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:34,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842582819] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:34,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:15:34,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 21 [2025-03-08 11:15:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188211686] [2025-03-08 11:15:34,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:34,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:15:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:34,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:15:34,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:15:34,130 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:34,860 INFO L93 Difference]: Finished difference Result 413 states and 598 transitions. [2025-03-08 11:15:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:15:34,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2025-03-08 11:15:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:34,862 INFO L225 Difference]: With dead ends: 413 [2025-03-08 11:15:34,862 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 11:15:34,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:15:34,863 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 281 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:34,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 871 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:15:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 11:15:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 141. [2025-03-08 11:15:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 109 states have internal predecessors, (152), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2025-03-08 11:15:34,870 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 187 [2025-03-08 11:15:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:34,871 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2025-03-08 11:15:34,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2025-03-08 11:15:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:15:34,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:34,872 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:34,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 11:15:35,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:35,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:35,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2041422811, now seen corresponding path program 1 times [2025-03-08 11:15:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:35,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621722034] [2025-03-08 11:15:35,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:35,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:35,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:35,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:35,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:35,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:35,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621722034] [2025-03-08 11:15:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621722034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850175206] [2025-03-08 11:15:35,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:35,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:35,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:35,797 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:35,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 11:15:35,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:35,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:35,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:35,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:35,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 11:15:35,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-08 11:15:36,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:15:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:36,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850175206] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:36,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:15:36,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 21 [2025-03-08 11:15:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040102423] [2025-03-08 11:15:36,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:36,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:15:36,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:36,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:15:36,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:15:36,842 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:37,703 INFO L93 Difference]: Finished difference Result 418 states and 606 transitions. [2025-03-08 11:15:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:15:37,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2025-03-08 11:15:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:37,705 INFO L225 Difference]: With dead ends: 418 [2025-03-08 11:15:37,705 INFO L226 Difference]: Without dead ends: 280 [2025-03-08 11:15:37,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:15:37,706 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 237 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:37,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 804 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:15:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-08 11:15:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 140. [2025-03-08 11:15:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 108 states have internal predecessors, (150), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2025-03-08 11:15:37,715 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 187 [2025-03-08 11:15:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:37,716 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2025-03-08 11:15:37,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2025-03-08 11:15:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:15:37,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:37,718 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:37,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 11:15:37,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 11:15:37,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:37,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:37,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1816785200, now seen corresponding path program 1 times [2025-03-08 11:15:37,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:37,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413009295] [2025-03-08 11:15:37,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:37,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:37,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:37,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:37,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:37,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:38,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:38,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413009295] [2025-03-08 11:15:38,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413009295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:15:38,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520215523] [2025-03-08 11:15:38,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:38,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:38,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:38,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:38,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 11:15:38,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:15:38,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:15:38,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:38,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:38,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 11:15:38,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 566 proven. 120 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2025-03-08 11:15:39,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:15:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 123 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-03-08 11:15:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520215523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:15:39,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:15:39,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-03-08 11:15:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16740447] [2025-03-08 11:15:39,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:15:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 11:15:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 11:15:39,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-03-08 11:15:39,836 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 7 states have call successors, (84), 4 states have call predecessors, (84), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2025-03-08 11:15:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:43,019 INFO L93 Difference]: Finished difference Result 499 states and 719 transitions. [2025-03-08 11:15:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 11:15:43,020 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 7 states have call successors, (84), 4 states have call predecessors, (84), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) Word has length 187 [2025-03-08 11:15:43,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:43,022 INFO L225 Difference]: With dead ends: 499 [2025-03-08 11:15:43,022 INFO L226 Difference]: Without dead ends: 362 [2025-03-08 11:15:43,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=707, Invalid=2953, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 11:15:43,023 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 895 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:43,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 1087 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 11:15:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-08 11:15:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 237. [2025-03-08 11:15:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 172 states have internal predecessors, (229), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 11:15:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 341 transitions. [2025-03-08 11:15:43,048 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 341 transitions. Word has length 187 [2025-03-08 11:15:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:43,049 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 341 transitions. [2025-03-08 11:15:43,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 7 states have call successors, (84), 4 states have call predecessors, (84), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2025-03-08 11:15:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 341 transitions. [2025-03-08 11:15:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 11:15:43,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:43,051 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:43,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 11:15:43,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 11:15:43,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash -108659604, now seen corresponding path program 1 times [2025-03-08 11:15:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632811998] [2025-03-08 11:15:43,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:43,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 11:15:43,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 11:15:43,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:43,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:15:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516482380] [2025-03-08 11:15:43,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:43,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:43,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:43,298 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:43,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 11:15:43,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 11:15:43,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 11:15:43,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:43,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:43,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 11:15:43,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 421 proven. 69 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2025-03-08 11:15:43,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:15:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 11:15:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632811998] [2025-03-08 11:15:43,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:15:43,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516482380] [2025-03-08 11:15:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516482380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:15:43,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:15:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-08 11:15:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648213855] [2025-03-08 11:15:43,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:15:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:15:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:43,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:15:43,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:15:43,970 INFO L87 Difference]: Start difference. First operand 237 states and 341 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-08 11:15:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:44,818 INFO L93 Difference]: Finished difference Result 655 states and 907 transitions. [2025-03-08 11:15:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 11:15:44,818 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) Word has length 189 [2025-03-08 11:15:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:44,821 INFO L225 Difference]: With dead ends: 655 [2025-03-08 11:15:44,821 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 11:15:44,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2025-03-08 11:15:44,822 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 336 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:44,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1086 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:15:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 11:15:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 315. [2025-03-08 11:15:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 248 states have (on average 1.342741935483871) internal successors, (333), 248 states have internal predecessors, (333), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 11:15:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 445 transitions. [2025-03-08 11:15:44,840 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 445 transitions. Word has length 189 [2025-03-08 11:15:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:44,841 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 445 transitions. [2025-03-08 11:15:44,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-08 11:15:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 445 transitions. [2025-03-08 11:15:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 11:15:44,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:44,844 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:44,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 11:15:45,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 11:15:45,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:45,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1078430814, now seen corresponding path program 1 times [2025-03-08 11:15:45,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:45,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202517429] [2025-03-08 11:15:45,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:45,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 11:15:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 11:15:45,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:45,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:45,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202517429] [2025-03-08 11:15:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202517429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:45,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:45,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:15:45,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61887384] [2025-03-08 11:15:45,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:45,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:15:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:45,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:15:45,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:15:45,090 INFO L87 Difference]: Start difference. First operand 315 states and 445 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:45,155 INFO L93 Difference]: Finished difference Result 807 states and 1139 transitions. [2025-03-08 11:15:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:15:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2025-03-08 11:15:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:45,159 INFO L225 Difference]: With dead ends: 807 [2025-03-08 11:15:45,159 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 11:15:45,160 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-08 11:15:45,161 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 141 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:45,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 295 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:15:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 11:15:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 315. [2025-03-08 11:15:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 248 states have internal predecessors, (331), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 11:15:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 443 transitions. [2025-03-08 11:15:45,188 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 443 transitions. Word has length 189 [2025-03-08 11:15:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:45,188 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 443 transitions. [2025-03-08 11:15:45,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 443 transitions. [2025-03-08 11:15:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 11:15:45,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:45,191 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:45,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:15:45,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:45,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -855404828, now seen corresponding path program 1 times [2025-03-08 11:15:45,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:45,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098855092] [2025-03-08 11:15:45,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:45,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 11:15:45,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 11:15:45,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:45,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:45,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:45,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098855092] [2025-03-08 11:15:45,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098855092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:45,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:45,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:15:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958420889] [2025-03-08 11:15:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:45,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:15:45,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:45,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:15:45,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:15:45,683 INFO L87 Difference]: Start difference. First operand 315 states and 443 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:46,150 INFO L93 Difference]: Finished difference Result 1050 states and 1416 transitions. [2025-03-08 11:15:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:15:46,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2025-03-08 11:15:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:46,154 INFO L225 Difference]: With dead ends: 1050 [2025-03-08 11:15:46,154 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 11:15:46,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:15:46,156 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 186 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:46,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 962 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:15:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 11:15:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 490. [2025-03-08 11:15:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 391 states have (on average 1.3171355498721227) internal successors, (515), 393 states have internal predecessors, (515), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 11:15:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 671 transitions. [2025-03-08 11:15:46,209 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 671 transitions. Word has length 189 [2025-03-08 11:15:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:46,209 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 671 transitions. [2025-03-08 11:15:46,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 671 transitions. [2025-03-08 11:15:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 11:15:46,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:46,211 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:46,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:15:46,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1074246790, now seen corresponding path program 1 times [2025-03-08 11:15:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697054728] [2025-03-08 11:15:46,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:46,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:15:46,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:15:46,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:46,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:47,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697054728] [2025-03-08 11:15:47,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697054728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:47,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:47,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:15:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933422005] [2025-03-08 11:15:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:47,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:15:47,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:47,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:15:47,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:15:47,656 INFO L87 Difference]: Start difference. First operand 490 states and 671 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:48,973 INFO L93 Difference]: Finished difference Result 1325 states and 1812 transitions. [2025-03-08 11:15:48,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:15:48,974 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2025-03-08 11:15:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:48,978 INFO L225 Difference]: With dead ends: 1325 [2025-03-08 11:15:48,978 INFO L226 Difference]: Without dead ends: 876 [2025-03-08 11:15:48,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:15:48,979 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 399 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:48,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1593 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:15:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-08 11:15:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 657. [2025-03-08 11:15:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 523 states have (on average 1.3021032504780115) internal successors, (681), 526 states have internal predecessors, (681), 106 states have call successors, (106), 27 states have call predecessors, (106), 27 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 11:15:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 893 transitions. [2025-03-08 11:15:49,033 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 893 transitions. Word has length 190 [2025-03-08 11:15:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:49,034 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 893 transitions. [2025-03-08 11:15:49,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 893 transitions. [2025-03-08 11:15:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 11:15:49,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:49,035 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:49,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:15:49,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:49,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash -851220804, now seen corresponding path program 1 times [2025-03-08 11:15:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:49,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705735085] [2025-03-08 11:15:49,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:49,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:15:49,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:15:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 11:15:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705735085] [2025-03-08 11:15:49,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705735085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:49,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:49,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:15:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002069747] [2025-03-08 11:15:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:49,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:15:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:49,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:15:49,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:15:49,320 INFO L87 Difference]: Start difference. First operand 657 states and 893 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:49,895 INFO L93 Difference]: Finished difference Result 1479 states and 1995 transitions. [2025-03-08 11:15:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:15:49,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2025-03-08 11:15:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:49,899 INFO L225 Difference]: With dead ends: 1479 [2025-03-08 11:15:49,899 INFO L226 Difference]: Without dead ends: 863 [2025-03-08 11:15:49,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:15:49,901 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 174 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:49,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 537 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:15:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-08 11:15:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 685. [2025-03-08 11:15:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 551 states have (on average 1.2976406533575318) internal successors, (715), 554 states have internal predecessors, (715), 106 states have call successors, (106), 27 states have call predecessors, (106), 27 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 11:15:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 927 transitions. [2025-03-08 11:15:49,963 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 927 transitions. Word has length 190 [2025-03-08 11:15:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:49,964 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 927 transitions. [2025-03-08 11:15:49,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 11:15:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 927 transitions. [2025-03-08 11:15:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 11:15:49,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:49,966 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:49,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 11:15:49,966 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:49,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash 584658883, now seen corresponding path program 1 times [2025-03-08 11:15:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554525817] [2025-03-08 11:15:49,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:49,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:15:50,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:15:50,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:50,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:15:50,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534087107] [2025-03-08 11:15:50,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:15:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:50,008 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:15:50,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 11:15:50,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:15:50,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:15:50,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:50,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:15:50,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:15:50,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:15:50,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:15:50,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:50,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:15:50,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:15:50,266 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:15:50,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:15:50,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 11:15:50,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 11:15:50,472 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:50,564 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:15:50,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:15:50 BoogieIcfgContainer [2025-03-08 11:15:50,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:15:50,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:15:50,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:15:50,567 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:15:50,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:15:04" (3/4) ... [2025-03-08 11:15:50,569 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:15:50,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:15:50,570 INFO L158 Benchmark]: Toolchain (without parser) took 46576.74ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 112.1MB in the beginning and 311.6MB in the end (delta: -199.4MB). Peak memory consumption was 126.2MB. Max. memory is 16.1GB. [2025-03-08 11:15:50,570 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:15:50,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.83ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:15:50,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.89ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:15:50,570 INFO L158 Benchmark]: Boogie Preprocessor took 31.98ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:15:50,571 INFO L158 Benchmark]: IcfgBuilder took 443.27ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 62.2MB in the end (delta: 29.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 11:15:50,571 INFO L158 Benchmark]: TraceAbstraction took 45842.89ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 61.3MB in the beginning and 315.9MB in the end (delta: -254.5MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2025-03-08 11:15:50,571 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 469.8MB. Free memory was 315.9MB in the beginning and 311.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:15:50,572 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.83ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.89ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.98ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 443.27ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 62.2MB in the end (delta: 29.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45842.89ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 61.3MB in the beginning and 315.9MB in the end (delta: -254.5MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 469.8MB. Free memory was 315.9MB in the beginning and 311.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 170, overapproximation of shiftLeft at line 82, overapproximation of someUnaryDOUBLEoperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 170. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 2; [L42] double var_1_25 = 127.75; [L43] double var_1_26 = 9999999999999.2; [L44] double var_1_27 = 9.1; [L45] signed long int var_1_28 = -64; [L46] unsigned char var_1_29 = 8; [L47] unsigned char var_1_30 = 10; [L48] unsigned char var_1_31 = 0; [L49] unsigned char last_1_var_1_10 = 32; [L50] unsigned short int last_1_var_1_12 = 16; [L51] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L165] last_1_var_1_10 = var_1_10 [L166] last_1_var_1_12 = var_1_12 [L167] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L120] var_1_3 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L122] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L122] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] var_1_5 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L124] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L125] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L125] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L127] var_1_6 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L128] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L130] var_1_7 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L131] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L132] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L132] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L133] var_1_8 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L134] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L135] var_1_9 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L136] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L139] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L139] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L142] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L142] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L143] var_1_20 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L144] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L145] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L146] var_1_21 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L147] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L148] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L149] var_1_22 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L150] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L151] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L151] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L153] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L154] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L154] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L155] var_1_27 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L156] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L157] var_1_30 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L158] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L159] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L160] var_1_31 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L162] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L178] RET updateVariables() [L179] CALL step() [L55] COND FALSE !(var_1_20 || var_1_21) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L58] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L59] COND TRUE var_1_23 > var_1_19 [L60] var_1_25 = ((((999999.5) < 0 ) ? -(999999.5) : (999999.5))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L62] COND FALSE !(var_1_22 < ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L67] var_1_28 = -256 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L68] COND TRUE var_1_28 != -32 [L69] var_1_29 = (var_1_30 + var_1_31) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L73] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L74] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L76] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L77] COND TRUE var_1_6 <= stepLocal_2 [L78] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L82] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L82] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L89] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L91] var_1_18 = var_1_3 [L92] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L93] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L94] COND FALSE !((- var_1_9) <= var_1_8) [L107] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L109] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L110] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L110] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L111] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L170] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L170] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L170] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L170] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L170-L171] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 194 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 16, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4548 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4541 mSDsluCounter, 10914 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8494 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7652 IncrementalHoareTripleChecker+Invalid, 7993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 2420 mSDtfsCounter, 7652 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3599 GetRequests, 3310 SyntacticMatches, 3 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2044 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=685occurred in iteration=15, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 1940 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 5066 NumberOfCodeBlocks, 5066 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5963 ConstructedInterpolants, 45 QuantifiedInterpolants, 25972 SizeOfPredicates, 85 NumberOfNonLiveVariables, 4333 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 46959/48384 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-08 11:15:50,692 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-25_file-9.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 e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:15:52,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:15:52,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:15:52,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:15:52,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:15:52,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:15:52,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:15:52,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:15:52,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:15:52,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:15:52,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:15:52,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:15:52,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:15:52,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:15:52,502 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:15:52,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:15:52,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:15:52,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:15:52,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:15:52,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:15:52,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:15:52,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:15:52,504 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 -> e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e [2025-03-08 11:15:52,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:15:52,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:15:52,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:15:52,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:15:52,733 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:15:52,735 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-25_file-9.i [2025-03-08 11:15:53,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f1eb255/956de5341fe54e15a2da238c4d4c4d53/FLAGf94ca8238 [2025-03-08 11:15:54,129 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:15:54,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2025-03-08 11:15:54,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f1eb255/956de5341fe54e15a2da238c4d4c4d53/FLAGf94ca8238 [2025-03-08 11:15:54,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f1eb255/956de5341fe54e15a2da238c4d4c4d53 [2025-03-08 11:15:54,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:15:54,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:15:54,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:15:54,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:15:54,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:15:54,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718f4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54, skipping insertion in model container [2025-03-08 11:15:54,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:15:54,595 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-25_file-9.i[914,927] [2025-03-08 11:15:54,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:15:54,645 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:15:54,652 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-25_file-9.i[914,927] [2025-03-08 11:15:54,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:15:54,684 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:15:54,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54 WrapperNode [2025-03-08 11:15:54,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:15:54,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:15:54,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:15:54,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:15:54,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,712 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-08 11:15:54,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:15:54,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:15:54,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:15:54,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:15:54,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,732 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-08 11:15:54,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:15:54,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:15:54,751 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:15:54,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:15:54,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (1/1) ... [2025-03-08 11:15:54,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:15:54,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:15:54,779 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-08 11:15:54,782 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-08 11:15:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:15:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:15:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:15:54,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:15:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:15:54,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:15:54,863 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:15:54,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:15:55,199 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 11:15:55,203 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:15:55,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:15:55,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:15:55,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:15:55 BoogieIcfgContainer [2025-03-08 11:15:55,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:15:55,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:15:55,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:15:55,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:15:55,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:15:54" (1/3) ... [2025-03-08 11:15:55,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a085112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:15:55, skipping insertion in model container [2025-03-08 11:15:55,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:54" (2/3) ... [2025-03-08 11:15:55,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a085112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:15:55, skipping insertion in model container [2025-03-08 11:15:55,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:15:55" (3/3) ... [2025-03-08 11:15:55,225 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2025-03-08 11:15:55,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:15:55,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:15:55,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:15:55,293 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;@18bd78a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:15:55,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:15:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 11:15:55,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:55,308 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:55,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:55,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1020453108, now seen corresponding path program 1 times [2025-03-08 11:15:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:15:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065610638] [2025-03-08 11:15:55,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:55,321 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-08 11:15:55,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:15:55,324 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-08 11:15:55,325 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-08 11:15:55,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 11:15:55,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 11:15:55,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:55,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:55,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:15:55,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:15:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-08 11:15:55,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:15:55,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:15:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065610638] [2025-03-08 11:15:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065610638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:15:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900803762] [2025-03-08 11:15:55,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:55,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:15:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:15:55,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:15:55,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:15:55,610 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 11:15:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:55,634 INFO L93 Difference]: Finished difference Result 156 states and 273 transitions. [2025-03-08 11:15:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:15:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2025-03-08 11:15:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:55,642 INFO L225 Difference]: With dead ends: 156 [2025-03-08 11:15:55,642 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 11:15:55,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 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-08 11:15:55,648 INFO L435 NwaCegarLoop]: 119 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, 119 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-08 11:15:55,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:15:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 11:15:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-08 11:15:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:15:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2025-03-08 11:15:55,685 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 178 [2025-03-08 11:15:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:55,685 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2025-03-08 11:15:55,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 11:15:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2025-03-08 11:15:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 11:15:55,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:55,691 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:15:55,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:15:55,892 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-08 11:15:55,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:55,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -420157635, now seen corresponding path program 1 times [2025-03-08 11:15:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:15:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483357657] [2025-03-08 11:15:55,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:55,893 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-08 11:15:55,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:15:55,895 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-08 11:15:55,897 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-08 11:15:55,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 11:15:56,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 11:15:56,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:56,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:56,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 11:15:56,096 INFO L279 TraceCheckSpWp]: Computing forward predicates...