./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 67b4385bfa6e31a60d16ae9820cda3bada637e495c6490466afc71d2ba1f1751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:24:58,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:24:58,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:24:58,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:24:58,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:24:58,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:24:58,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:24:58,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:24:58,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:24:58,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:24:58,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:24:58,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:24:58,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:24:58,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:24:58,900 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:24:58,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:24:58,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:24:58,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:24:58,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:24:58,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:24:58,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:24:58,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:24:58,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:24:58,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:24:58,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:24:58,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:24:58,903 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-jdk21/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 -> 67b4385bfa6e31a60d16ae9820cda3bada637e495c6490466afc71d2ba1f1751 [2025-02-05 22:24:59,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:24:59,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:24:59,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:24:59,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:24:59,121 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:24:59,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2025-02-05 22:25:00,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42abba7ab/97dfb8008cf940d3a55c6da2a28ecc68/FLAG36b090923 [2025-02-05 22:25:00,660 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:25:00,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2025-02-05 22:25:00,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42abba7ab/97dfb8008cf940d3a55c6da2a28ecc68/FLAG36b090923 [2025-02-05 22:25:00,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42abba7ab/97dfb8008cf940d3a55c6da2a28ecc68 [2025-02-05 22:25:00,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:25:00,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:25:00,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:25:00,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:25:00,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:25:00,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:25:00" (1/1) ... [2025-02-05 22:25:00,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc7c8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:00, skipping insertion in model container [2025-02-05 22:25:00,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:25:00" (1/1) ... [2025-02-05 22:25:00,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:25:01,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i[919,932] [2025-02-05 22:25:01,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:25:01,103 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:25:01,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i[919,932] [2025-02-05 22:25:01,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:25:01,172 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:25:01,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01 WrapperNode [2025-02-05 22:25:01,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:25:01,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:25:01,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:25:01,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:25:01,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,252 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 270 [2025-02-05 22:25:01,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:25:01,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:25:01,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:25:01,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:25:01,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,295 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-02-05 22:25:01,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:25:01,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:25:01,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:25:01,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:25:01,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (1/1) ... [2025-02-05 22:25:01,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:25:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:25:01,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:25:01,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:25:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:25:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:25:01,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:25:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:25:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:25:01,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:25:01,452 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:25:01,454 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:25:01,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~bitwise25#1;havoc property_#t~short26#1;havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-02-05 22:25:01,931 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 22:25:01,932 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:25:01,964 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:25:01,964 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:25:01,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:25:01 BoogieIcfgContainer [2025-02-05 22:25:01,965 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:25:01,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:25:01,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:25:01,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:25:01,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:25:00" (1/3) ... [2025-02-05 22:25:01,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2710acde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:25:01, skipping insertion in model container [2025-02-05 22:25:01,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:01" (2/3) ... [2025-02-05 22:25:01,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2710acde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:25:01, skipping insertion in model container [2025-02-05 22:25:01,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:25:01" (3/3) ... [2025-02-05 22:25:01,975 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2025-02-05 22:25:01,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:25:01,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:25:02,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:25:02,051 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;@48f1ff5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:25:02,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:25:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 82 states have internal predecessors, (119), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:25:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 22:25:02,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:02,073 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:02,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1395873881, now seen corresponding path program 1 times [2025-02-05 22:25:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:02,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827923573] [2025-02-05 22:25:02,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:02,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:02,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 22:25:02,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 22:25:02,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:02,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 22:25:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827923573] [2025-02-05 22:25:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827923573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:25:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512386877] [2025-02-05 22:25:02,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:25:02,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:25:02,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:25:02,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:25:02,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 22:25:02,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 22:25:02,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:02,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:02,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:25:02,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:25:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 22:25:02,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:25:02,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512386877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:02,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:25:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:25:02,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426029520] [2025-02-05 22:25:02,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:02,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:25:02,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:02,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:25:02,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:25:02,515 INFO L87 Difference]: Start difference. First operand has 114 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 82 states have internal predecessors, (119), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:25:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:02,564 INFO L93 Difference]: Finished difference Result 222 states and 383 transitions. [2025-02-05 22:25:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:25:02,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2025-02-05 22:25:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:02,571 INFO L225 Difference]: With dead ends: 222 [2025-02-05 22:25:02,571 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 22:25:02,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 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-02-05 22:25:02,574 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:02,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:25:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 22:25:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-05 22:25:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:25:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 174 transitions. [2025-02-05 22:25:02,633 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 174 transitions. Word has length 198 [2025-02-05 22:25:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:02,637 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 174 transitions. [2025-02-05 22:25:02,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:25:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 174 transitions. [2025-02-05 22:25:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 22:25:02,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:02,639 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:02,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:25:02,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:25:02,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:02,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 770657247, now seen corresponding path program 1 times [2025-02-05 22:25:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596596797] [2025-02-05 22:25:02,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:02,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 22:25:02,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 22:25:02,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:02,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596596797] [2025-02-05 22:25:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596596797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:03,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:25:03,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252828935] [2025-02-05 22:25:03,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:03,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:25:03,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:03,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:25:03,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:25:03,187 INFO L87 Difference]: Start difference. First operand 111 states and 174 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:03,255 INFO L93 Difference]: Finished difference Result 219 states and 345 transitions. [2025-02-05 22:25:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:25:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-02-05 22:25:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:03,258 INFO L225 Difference]: With dead ends: 219 [2025-02-05 22:25:03,258 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 22:25:03,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:25:03,261 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:03,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:25:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 22:25:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-05 22:25:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:25:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 173 transitions. [2025-02-05 22:25:03,274 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 173 transitions. Word has length 198 [2025-02-05 22:25:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:03,278 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 173 transitions. [2025-02-05 22:25:03,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 173 transitions. [2025-02-05 22:25:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:25:03,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:03,280 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:03,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:25:03,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash 298066990, now seen corresponding path program 1 times [2025-02-05 22:25:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112805690] [2025-02-05 22:25:03,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:03,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:25:03,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:25:03,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:03,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112805690] [2025-02-05 22:25:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112805690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:25:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537637525] [2025-02-05 22:25:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:03,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:25:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:03,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:25:03,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:25:03,587 INFO L87 Difference]: Start difference. First operand 111 states and 173 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:03,785 INFO L93 Difference]: Finished difference Result 328 states and 514 transitions. [2025-02-05 22:25:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:25:03,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2025-02-05 22:25:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:03,788 INFO L225 Difference]: With dead ends: 328 [2025-02-05 22:25:03,790 INFO L226 Difference]: Without dead ends: 220 [2025-02-05 22:25:03,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:25:03,792 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 124 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:03,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:25:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-05 22:25:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2025-02-05 22:25:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.4285714285714286) internal successors, (200), 140 states have internal predecessors, (200), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:25:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 320 transitions. [2025-02-05 22:25:03,828 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 320 transitions. Word has length 199 [2025-02-05 22:25:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:03,829 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 320 transitions. [2025-02-05 22:25:03,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 320 transitions. [2025-02-05 22:25:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 22:25:03,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:03,833 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:03,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:25:03,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:03,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash -979161242, now seen corresponding path program 1 times [2025-02-05 22:25:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969661621] [2025-02-05 22:25:03,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:03,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 22:25:03,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 22:25:03,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969661621] [2025-02-05 22:25:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969661621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:25:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935305827] [2025-02-05 22:25:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:04,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:25:04,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:04,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:25:04,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:25:04,071 INFO L87 Difference]: Start difference. First operand 203 states and 320 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:04,304 INFO L93 Difference]: Finished difference Result 514 states and 816 transitions. [2025-02-05 22:25:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:25:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2025-02-05 22:25:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:04,310 INFO L225 Difference]: With dead ends: 514 [2025-02-05 22:25:04,310 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 22:25:04,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:25:04,314 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 196 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:04,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 521 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:25:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 22:25:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 354. [2025-02-05 22:25:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 260 states have (on average 1.476923076923077) internal successors, (384), 260 states have internal predecessors, (384), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 22:25:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 564 transitions. [2025-02-05 22:25:04,373 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 564 transitions. Word has length 200 [2025-02-05 22:25:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:04,374 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 564 transitions. [2025-02-05 22:25:04,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 564 transitions. [2025-02-05 22:25:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 22:25:04,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:04,376 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:04,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:25:04,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:04,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash 484228299, now seen corresponding path program 1 times [2025-02-05 22:25:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:04,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243889317] [2025-02-05 22:25:04,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:04,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:25:04,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:25:04,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:04,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:04,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:04,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243889317] [2025-02-05 22:25:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243889317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:04,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:04,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:25:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571202801] [2025-02-05 22:25:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:04,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:25:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:04,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:25:04,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:25:04,678 INFO L87 Difference]: Start difference. First operand 354 states and 564 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:05,005 INFO L93 Difference]: Finished difference Result 993 states and 1575 transitions. [2025-02-05 22:25:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:25:05,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2025-02-05 22:25:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:05,012 INFO L225 Difference]: With dead ends: 993 [2025-02-05 22:25:05,012 INFO L226 Difference]: Without dead ends: 711 [2025-02-05 22:25:05,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:25:05,015 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 437 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:05,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 996 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:25:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-02-05 22:25:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 645. [2025-02-05 22:25:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 489 states have (on average 1.5010224948875255) internal successors, (734), 489 states have internal predecessors, (734), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-05 22:25:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1034 transitions. [2025-02-05 22:25:05,072 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1034 transitions. Word has length 201 [2025-02-05 22:25:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:05,072 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1034 transitions. [2025-02-05 22:25:05,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1034 transitions. [2025-02-05 22:25:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 22:25:05,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:05,074 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:05,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:25:05,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:05,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash -512844054, now seen corresponding path program 1 times [2025-02-05 22:25:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981127129] [2025-02-05 22:25:05,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:05,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:25:05,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:25:05,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:05,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:05,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:05,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981127129] [2025-02-05 22:25:05,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981127129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:05,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:05,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:25:05,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670071017] [2025-02-05 22:25:05,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:05,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:25:05,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:05,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:25:05,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:25:05,417 INFO L87 Difference]: Start difference. First operand 645 states and 1034 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:05,677 INFO L93 Difference]: Finished difference Result 1291 states and 2057 transitions. [2025-02-05 22:25:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:25:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2025-02-05 22:25:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:05,683 INFO L225 Difference]: With dead ends: 1291 [2025-02-05 22:25:05,683 INFO L226 Difference]: Without dead ends: 707 [2025-02-05 22:25:05,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:25:05,686 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 116 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:05,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 461 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:25:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-02-05 22:25:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 653. [2025-02-05 22:25:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 497 states have (on average 1.4909456740442657) internal successors, (741), 497 states have internal predecessors, (741), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-05 22:25:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1041 transitions. [2025-02-05 22:25:05,755 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1041 transitions. Word has length 201 [2025-02-05 22:25:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:05,756 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1041 transitions. [2025-02-05 22:25:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1041 transitions. [2025-02-05 22:25:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 22:25:05,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:05,780 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:05,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:25:05,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:05,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash -345101277, now seen corresponding path program 1 times [2025-02-05 22:25:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:05,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309919337] [2025-02-05 22:25:05,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:05,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 22:25:05,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 22:25:05,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:05,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:06,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309919337] [2025-02-05 22:25:06,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309919337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:06,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:06,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:25:06,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790753443] [2025-02-05 22:25:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:06,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:25:06,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:06,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:25:06,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:25:06,038 INFO L87 Difference]: Start difference. First operand 653 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:06,341 INFO L93 Difference]: Finished difference Result 1663 states and 2653 transitions. [2025-02-05 22:25:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:25:06,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2025-02-05 22:25:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:06,346 INFO L225 Difference]: With dead ends: 1663 [2025-02-05 22:25:06,346 INFO L226 Difference]: Without dead ends: 1067 [2025-02-05 22:25:06,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:25:06,348 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 195 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:06,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 684 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:25:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-02-05 22:25:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 922. [2025-02-05 22:25:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 704 states have (on average 1.4857954545454546) internal successors, (1046), 704 states have internal predecessors, (1046), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 22:25:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1466 transitions. [2025-02-05 22:25:06,426 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1466 transitions. Word has length 202 [2025-02-05 22:25:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:06,426 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1466 transitions. [2025-02-05 22:25:06,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1466 transitions. [2025-02-05 22:25:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 22:25:06,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:06,428 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:06,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:25:06,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:06,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash -333785150, now seen corresponding path program 1 times [2025-02-05 22:25:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804379896] [2025-02-05 22:25:06,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:06,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 22:25:06,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 22:25:06,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:06,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:06,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804379896] [2025-02-05 22:25:06,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804379896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:06,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:06,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:25:06,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251332801] [2025-02-05 22:25:06,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:06,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:25:06,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:06,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:25:06,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:25:06,711 INFO L87 Difference]: Start difference. First operand 922 states and 1466 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:06,856 INFO L93 Difference]: Finished difference Result 1884 states and 3000 transitions. [2025-02-05 22:25:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:25:06,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2025-02-05 22:25:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:06,861 INFO L225 Difference]: With dead ends: 1884 [2025-02-05 22:25:06,861 INFO L226 Difference]: Without dead ends: 1184 [2025-02-05 22:25:06,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:25:06,863 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 123 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:06,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 645 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:25:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-02-05 22:25:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1114. [2025-02-05 22:25:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 896 states have (on average 1.5145089285714286) internal successors, (1357), 896 states have internal predecessors, (1357), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 22:25:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1777 transitions. [2025-02-05 22:25:06,924 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1777 transitions. Word has length 202 [2025-02-05 22:25:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:06,924 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1777 transitions. [2025-02-05 22:25:06,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1777 transitions. [2025-02-05 22:25:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 22:25:06,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:06,926 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:06,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:25:06,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:06,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash 227811338, now seen corresponding path program 1 times [2025-02-05 22:25:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552797398] [2025-02-05 22:25:06,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:06,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 22:25:06,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 22:25:06,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:06,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552797398] [2025-02-05 22:25:08,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552797398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:08,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:08,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:25:08,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000957650] [2025-02-05 22:25:08,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:08,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:25:08,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:08,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:25:08,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:25:08,057 INFO L87 Difference]: Start difference. First operand 1114 states and 1777 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:09,073 INFO L93 Difference]: Finished difference Result 1943 states and 3082 transitions. [2025-02-05 22:25:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:25:09,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 207 [2025-02-05 22:25:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:09,080 INFO L225 Difference]: With dead ends: 1943 [2025-02-05 22:25:09,080 INFO L226 Difference]: Without dead ends: 1259 [2025-02-05 22:25:09,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:25:09,082 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 451 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:09,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 715 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:25:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-02-05 22:25:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1165. [2025-02-05 22:25:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 947 states have (on average 1.5237592397043294) internal successors, (1443), 947 states have internal predecessors, (1443), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 22:25:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1863 transitions. [2025-02-05 22:25:09,158 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1863 transitions. Word has length 207 [2025-02-05 22:25:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:09,158 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1863 transitions. [2025-02-05 22:25:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1863 transitions. [2025-02-05 22:25:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 22:25:09,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:09,162 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:09,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:25:09,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash -277747287, now seen corresponding path program 1 times [2025-02-05 22:25:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918732152] [2025-02-05 22:25:09,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:09,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 22:25:09,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 22:25:09,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:09,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:25:09,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:09,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918732152] [2025-02-05 22:25:09,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918732152] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:25:09,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952633576] [2025-02-05 22:25:09,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:09,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:25:09,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:25:09,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:25:09,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:25:09,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 22:25:09,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 22:25:09,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:09,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:09,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:25:09,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:25:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-02-05 22:25:09,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:25:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:25:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952633576] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:25:10,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:25:10,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 22:25:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117004893] [2025-02-05 22:25:10,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:25:10,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:25:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:10,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:25:10,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:25:10,052 INFO L87 Difference]: Start difference. First operand 1165 states and 1863 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-02-05 22:25:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:10,267 INFO L93 Difference]: Finished difference Result 2235 states and 3540 transitions. [2025-02-05 22:25:10,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:25:10,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 207 [2025-02-05 22:25:10,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:10,275 INFO L225 Difference]: With dead ends: 2235 [2025-02-05 22:25:10,275 INFO L226 Difference]: Without dead ends: 1207 [2025-02-05 22:25:10,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:25:10,278 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 100 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:10,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 308 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:25:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-02-05 22:25:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1193. [2025-02-05 22:25:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 968 states have (on average 1.4132231404958677) internal successors, (1368), 968 states have internal predecessors, (1368), 210 states have call successors, (210), 14 states have call predecessors, (210), 14 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 22:25:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1788 transitions. [2025-02-05 22:25:10,328 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1788 transitions. Word has length 207 [2025-02-05 22:25:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:10,329 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1788 transitions. [2025-02-05 22:25:10,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-02-05 22:25:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1788 transitions. [2025-02-05 22:25:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 22:25:10,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:10,333 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:10,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:25:10,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:25:10,534 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:10,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2125113516, now seen corresponding path program 1 times [2025-02-05 22:25:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731783298] [2025-02-05 22:25:10,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:10,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 22:25:10,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 22:25:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:10,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731783298] [2025-02-05 22:25:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731783298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:10,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:25:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935559809] [2025-02-05 22:25:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:25:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:10,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:25:10,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:25:10,601 INFO L87 Difference]: Start difference. First operand 1193 states and 1788 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:10,682 INFO L93 Difference]: Finished difference Result 2865 states and 4272 transitions. [2025-02-05 22:25:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:25:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 210 [2025-02-05 22:25:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:10,691 INFO L225 Difference]: With dead ends: 2865 [2025-02-05 22:25:10,691 INFO L226 Difference]: Without dead ends: 1858 [2025-02-05 22:25:10,694 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-02-05 22:25:10,695 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 103 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:10,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 336 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:25:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-02-05 22:25:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1850. [2025-02-05 22:25:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1492 states have (on average 1.371313672922252) internal successors, (2046), 1498 states have internal predecessors, (2046), 330 states have call successors, (330), 27 states have call predecessors, (330), 27 states have return successors, (330), 324 states have call predecessors, (330), 330 states have call successors, (330) [2025-02-05 22:25:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2706 transitions. [2025-02-05 22:25:10,808 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2706 transitions. Word has length 210 [2025-02-05 22:25:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:10,809 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2706 transitions. [2025-02-05 22:25:10,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2706 transitions. [2025-02-05 22:25:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 22:25:10,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:10,811 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:10,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:25:10,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:10,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 131797491, now seen corresponding path program 1 times [2025-02-05 22:25:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:10,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394027681] [2025-02-05 22:25:10,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:10,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 22:25:10,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 22:25:10,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:10,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:25:10,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:10,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394027681] [2025-02-05 22:25:10,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394027681] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:25:10,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027238514] [2025-02-05 22:25:10,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:10,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:25:10,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:25:10,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:25:10,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:25:11,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 22:25:11,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 22:25:11,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:11,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:11,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:25:11,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:25:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 789 proven. 27 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:25:11,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:25:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:25:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027238514] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:25:11,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:25:11,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 22:25:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085827743] [2025-02-05 22:25:11,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:25:11,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:25:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:11,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:25:11,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:25:11,381 INFO L87 Difference]: Start difference. First operand 1850 states and 2706 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-02-05 22:25:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:11,648 INFO L93 Difference]: Finished difference Result 2964 states and 4297 transitions. [2025-02-05 22:25:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:25:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 210 [2025-02-05 22:25:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:11,663 INFO L225 Difference]: With dead ends: 2964 [2025-02-05 22:25:11,663 INFO L226 Difference]: Without dead ends: 1277 [2025-02-05 22:25:11,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:25:11,667 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 181 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:11,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 300 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:25:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-02-05 22:25:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1249. [2025-02-05 22:25:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1010 states have (on average 1.3326732673267327) internal successors, (1346), 1010 states have internal predecessors, (1346), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 22:25:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1766 transitions. [2025-02-05 22:25:11,744 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1766 transitions. Word has length 210 [2025-02-05 22:25:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:11,744 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1766 transitions. [2025-02-05 22:25:11,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-02-05 22:25:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1766 transitions. [2025-02-05 22:25:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:25:11,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:11,747 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:11,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 22:25:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:25:11,947 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1996404849, now seen corresponding path program 1 times [2025-02-05 22:25:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389540857] [2025-02-05 22:25:11,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:11,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:25:11,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:25:11,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:11,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:12,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:12,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389540857] [2025-02-05 22:25:12,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389540857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:12,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:12,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:25:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234826819] [2025-02-05 22:25:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:12,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:25:12,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:12,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:25:12,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:25:12,034 INFO L87 Difference]: Start difference. First operand 1249 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:12,088 INFO L93 Difference]: Finished difference Result 2319 states and 3305 transitions. [2025-02-05 22:25:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:25:12,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 212 [2025-02-05 22:25:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:12,096 INFO L225 Difference]: With dead ends: 2319 [2025-02-05 22:25:12,097 INFO L226 Difference]: Without dead ends: 1273 [2025-02-05 22:25:12,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-05 22:25:12,101 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:12,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:25:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-02-05 22:25:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1273. [2025-02-05 22:25:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1034 states have (on average 1.3249516441005802) internal successors, (1370), 1034 states have internal predecessors, (1370), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 22:25:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1790 transitions. [2025-02-05 22:25:12,157 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1790 transitions. Word has length 212 [2025-02-05 22:25:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:12,157 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1790 transitions. [2025-02-05 22:25:12,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1790 transitions. [2025-02-05 22:25:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:25:12,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:12,161 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:25:12,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash -945252750, now seen corresponding path program 1 times [2025-02-05 22:25:12,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:12,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393376953] [2025-02-05 22:25:12,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:12,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:12,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:25:12,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:25:12,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:12,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:25:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716532208] [2025-02-05 22:25:12,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:12,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:25:12,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:25:12,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:25:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 22:25:12,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:25:12,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:25:12,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:12,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:12,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 22:25:12,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:25:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 347 proven. 78 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2025-02-05 22:25:12,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:25:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:13,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393376953] [2025-02-05 22:25:13,258 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 22:25:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716532208] [2025-02-05 22:25:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716532208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:25:13,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:25:13,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-02-05 22:25:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185658703] [2025-02-05 22:25:13,258 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 22:25:13,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:25:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:13,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:25:13,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:25:13,259 INFO L87 Difference]: Start difference. First operand 1273 states and 1790 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:25:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:13,878 INFO L93 Difference]: Finished difference Result 2855 states and 3980 transitions. [2025-02-05 22:25:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 22:25:13,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 212 [2025-02-05 22:25:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:13,888 INFO L225 Difference]: With dead ends: 2855 [2025-02-05 22:25:13,888 INFO L226 Difference]: Without dead ends: 2039 [2025-02-05 22:25:13,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:25:13,891 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 227 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:13,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 673 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:25:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2025-02-05 22:25:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1981. [2025-02-05 22:25:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1586 states have (on average 1.315889029003783) internal successors, (2087), 1590 states have internal predecessors, (2087), 338 states have call successors, (338), 56 states have call predecessors, (338), 56 states have return successors, (338), 334 states have call predecessors, (338), 338 states have call successors, (338) [2025-02-05 22:25:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2763 transitions. [2025-02-05 22:25:13,981 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2763 transitions. Word has length 212 [2025-02-05 22:25:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:13,982 INFO L471 AbstractCegarLoop]: Abstraction has 1981 states and 2763 transitions. [2025-02-05 22:25:13,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:25:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2763 transitions. [2025-02-05 22:25:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:25:13,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:13,984 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:13,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 22:25:14,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 22:25:14,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:14,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1926332789, now seen corresponding path program 1 times [2025-02-05 22:25:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:14,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089818488] [2025-02-05 22:25:14,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:14,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:25:14,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:25:14,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:14,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:14,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089818488] [2025-02-05 22:25:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089818488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:14,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:25:14,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214877208] [2025-02-05 22:25:14,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:14,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:25:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:14,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:25:14,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:25:14,324 INFO L87 Difference]: Start difference. First operand 1981 states and 2763 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:14,482 INFO L93 Difference]: Finished difference Result 3437 states and 4825 transitions. [2025-02-05 22:25:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:25:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 212 [2025-02-05 22:25:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:14,497 INFO L225 Difference]: With dead ends: 3437 [2025-02-05 22:25:14,497 INFO L226 Difference]: Without dead ends: 2622 [2025-02-05 22:25:14,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:25:14,500 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 108 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:14,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 472 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:25:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2025-02-05 22:25:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1984. [2025-02-05 22:25:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1589 states have (on average 1.31529263687854) internal successors, (2090), 1593 states have internal predecessors, (2090), 338 states have call successors, (338), 56 states have call predecessors, (338), 56 states have return successors, (338), 334 states have call predecessors, (338), 338 states have call successors, (338) [2025-02-05 22:25:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2766 transitions. [2025-02-05 22:25:14,635 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2766 transitions. Word has length 212 [2025-02-05 22:25:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:14,636 INFO L471 AbstractCegarLoop]: Abstraction has 1984 states and 2766 transitions. [2025-02-05 22:25:14,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2766 transitions. [2025-02-05 22:25:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:25:14,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:14,638 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:14,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:25:14,638 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:14,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1671596244, now seen corresponding path program 1 times [2025-02-05 22:25:14,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:14,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278282413] [2025-02-05 22:25:14,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:14,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:25:14,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:25:14,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:14,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:25:15,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278282413] [2025-02-05 22:25:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278282413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:15,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:25:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341716785] [2025-02-05 22:25:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:15,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:25:15,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:25:15,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:25:15,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:25:15,279 INFO L87 Difference]: Start difference. First operand 1984 states and 2766 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-02-05 22:25:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:15,882 INFO L93 Difference]: Finished difference Result 2796 states and 3907 transitions. [2025-02-05 22:25:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:25:15,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 212 [2025-02-05 22:25:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:15,892 INFO L225 Difference]: With dead ends: 2796 [2025-02-05 22:25:15,892 INFO L226 Difference]: Without dead ends: 2047 [2025-02-05 22:25:15,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:25:15,896 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 417 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:15,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 532 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:25:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-02-05 22:25:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1999. [2025-02-05 22:25:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1604 states have (on average 1.3135910224438903) internal successors, (2107), 1608 states have internal predecessors, (2107), 338 states have call successors, (338), 56 states have call predecessors, (338), 56 states have return successors, (338), 334 states have call predecessors, (338), 338 states have call successors, (338) [2025-02-05 22:25:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2783 transitions. [2025-02-05 22:25:15,998 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2783 transitions. Word has length 212 [2025-02-05 22:25:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:16,001 INFO L471 AbstractCegarLoop]: Abstraction has 1999 states and 2783 transitions. [2025-02-05 22:25:16,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-02-05 22:25:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2783 transitions. [2025-02-05 22:25:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:25:16,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:16,003 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:16,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 22:25:16,004 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1166037619, now seen corresponding path program 1 times [2025-02-05 22:25:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:25:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194860508] [2025-02-05 22:25:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:25:16,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:25:16,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:25:16,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:16,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:25:16,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866405141] [2025-02-05 22:25:16,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:16,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:25:16,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:25:16,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:25:16,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 22:25:16,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:25:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:25:16,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:16,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:25:16,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:25:16,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:25:16,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:25:16,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:16,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:25:16,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:25:16,464 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:25:16,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:25:16,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 22:25:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 22:25:16,670 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:16,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:25:16,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:25:16 BoogieIcfgContainer [2025-02-05 22:25:16,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:25:16,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:25:16,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:25:16,787 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:25:16,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:25:01" (3/4) ... [2025-02-05 22:25:16,794 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:25:16,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:25:16,795 INFO L158 Benchmark]: Toolchain (without parser) took 15885.60ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 111.6MB in the beginning and 196.9MB in the end (delta: -85.4MB). Peak memory consumption was 299.5MB. Max. memory is 16.1GB. [2025-02-05 22:25:16,795 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:25:16,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.82ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 93.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:25:16,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.64ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 85.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:25:16,795 INFO L158 Benchmark]: Boogie Preprocessor took 71.39ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 73.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:25:16,795 INFO L158 Benchmark]: IcfgBuilder took 639.08ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 97.4MB in the end (delta: -23.6MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2025-02-05 22:25:16,796 INFO L158 Benchmark]: TraceAbstraction took 14819.88ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 96.6MB in the beginning and 197.0MB in the end (delta: -100.4MB). Peak memory consumption was 283.6MB. Max. memory is 16.1GB. [2025-02-05 22:25:16,796 INFO L158 Benchmark]: Witness Printer took 7.34ms. Allocated memory is still 528.5MB. Free memory was 197.0MB in the beginning and 196.9MB in the end (delta: 108.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:25:16,800 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.82ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 93.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.64ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 85.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.39ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 73.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 639.08ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 97.4MB in the end (delta: -23.6MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14819.88ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 96.6MB in the beginning and 197.0MB in the end (delta: -100.4MB). Peak memory consumption was 283.6MB. Max. memory is 16.1GB. * Witness Printer took 7.34ms. Allocated memory is still 528.5MB. Free memory was 197.0MB in the beginning and 196.9MB in the end (delta: 108.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of bitwiseOr at line 183, overapproximation of bitwiseOr at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 146. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned short int var_1_24 = 8; [L43] unsigned short int var_1_26 = 26914; [L44] unsigned short int var_1_27 = 26182; [L45] unsigned char var_1_28 = 5; [L46] unsigned char var_1_29 = 50; [L47] unsigned char var_1_30 = 10; [L48] signed long int var_1_31 = -32; [L49] unsigned char var_1_32 = 0; [L50] unsigned char var_1_33 = 1; [L51] unsigned char var_1_34 = 0; [L52] signed long int var_1_35 = 1000000; [L53] signed long int var_1_36 = 64; [L54] unsigned char last_1_var_1_3 = 64; [L55] unsigned short int last_1_var_1_6 = 10; [L56] unsigned short int last_1_var_1_15 = 5; [L57] unsigned short int last_1_var_1_20 = 50; [L58] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_3 = var_1_3 [L177] last_1_var_1_6 = var_1_6 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 [L180] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L190] RET updateLastVariables() [L191] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L128] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] var_1_5 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] var_1_9 = __VERIFIER_nondet_long() [L134] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L134] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L135] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L135] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] var_1_10 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L139] var_1_11 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L140] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L141] var_1_12 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L142] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L143] var_1_13 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L144] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L145] var_1_14 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L146] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L147] var_1_17 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L148] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L149] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L149] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L150] var_1_18 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L152] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L152] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L155] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L155] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L156] var_1_26 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L158] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L158] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L159] var_1_27 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L161] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L161] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L162] var_1_29 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L164] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L164] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L165] var_1_30 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L167] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L167] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L168] var_1_33 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L170] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L170] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L171] var_1_34 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L173] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L173] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L191] RET updateVariables() [L192] CALL step() [L62] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L63] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L66] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L66] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L67] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L68] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L71] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L75] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L76] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L77] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L83] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L84] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L85] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L86] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L86] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L89] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L90] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L92] var_1_22 = var_1_5 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L93] COND TRUE ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4))) >= var_1_1 [L94] var_1_24 = ((var_1_26 + var_1_27) - var_1_4) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L96] COND TRUE var_1_27 > 0 [L97] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_5)) ? ((var_1_29 + var_1_30)) : (var_1_5)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_5)) ? ((var_1_29 + var_1_30)) : (var_1_5)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L99] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L100] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L104] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L105] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L105] COND FALSE !((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_6) [L108] var_1_32 = var_1_34 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L111] var_1_35 = ((((var_1_26) > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) ? (var_1_26) : (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L112] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L119] COND FALSE !(var_1_21 >= var_1_20) [L122] var_1_36 = var_1_4 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L183] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L183] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L183] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L183-L184] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=66, var_1_16=1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=65, var_1_24=32767, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=1, var_1_5=65, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 17, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2820 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2778 mSDsluCounter, 8074 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5414 mSDsCounter, 687 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2478 IncrementalHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 687 mSolverCounterUnsat, 2660 mSDtfsCounter, 2478 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1405 GetRequests, 1313 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1999occurred in iteration=16, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1258 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 4534 NumberOfCodeBlocks, 4534 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4294 ConstructedInterpolants, 0 QuantifiedInterpolants, 16985 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1921 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 36224/36540 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-02-05 22:25:16,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 67b4385bfa6e31a60d16ae9820cda3bada637e495c6490466afc71d2ba1f1751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:25:18,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:25:18,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:25:18,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:25:18,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:25:19,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:25:19,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:25:19,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:25:19,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:25:19,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:25:19,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:25:19,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:25:19,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:25:19,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:25:19,019 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:25:19,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:25:19,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:25:19,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:25:19,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:25:19,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:25:19,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:25:19,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:25:19,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:25:19,020 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:25:19,020 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:25:19,020 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:25:19,020 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:25:19,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:25:19,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:25:19,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:25:19,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:25:19,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:25:19,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:25:19,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:25:19,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:25:19,022 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-jdk21/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 -> 67b4385bfa6e31a60d16ae9820cda3bada637e495c6490466afc71d2ba1f1751 [2025-02-05 22:25:19,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:25:19,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:25:19,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:25:19,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:25:19,314 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:25:19,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2025-02-05 22:25:20,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfe2c0d9e/46b5684891c04e3c9ad8f193fe4ca506/FLAG944553caf [2025-02-05 22:25:20,719 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:25:20,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2025-02-05 22:25:20,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfe2c0d9e/46b5684891c04e3c9ad8f193fe4ca506/FLAG944553caf [2025-02-05 22:25:20,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfe2c0d9e/46b5684891c04e3c9ad8f193fe4ca506 [2025-02-05 22:25:20,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:25:20,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:25:20,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:25:20,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:25:20,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:25:20,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:25:20" (1/1) ... [2025-02-05 22:25:20,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03d0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:20, skipping insertion in model container [2025-02-05 22:25:20,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:25:20" (1/1) ... [2025-02-05 22:25:20,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:25:20,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i[919,932] [2025-02-05 22:25:20,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:25:20,997 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:25:21,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i[919,932] [2025-02-05 22:25:21,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:25:21,054 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:25:21,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21 WrapperNode [2025-02-05 22:25:21,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:25:21,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:25:21,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:25:21,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:25:21,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,109 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-02-05 22:25:21,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:25:21,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:25:21,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:25:21,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:25:21,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,146 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-02-05 22:25:21,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:25:21,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:25:21,175 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:25:21,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:25:21,176 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (1/1) ... [2025-02-05 22:25:21,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:25:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:25:21,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:25:21,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:25:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:25:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:25:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:25:21,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:25:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:25:21,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:25:21,292 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:25:21,293 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:25:29,798 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:25:29,799 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:25:29,806 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:25:29,806 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:25:29,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:25:29 BoogieIcfgContainer [2025-02-05 22:25:29,807 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:25:29,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:25:29,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:25:29,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:25:29,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:25:20" (1/3) ... [2025-02-05 22:25:29,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c28b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:25:29, skipping insertion in model container [2025-02-05 22:25:29,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:21" (2/3) ... [2025-02-05 22:25:29,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c28b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:25:29, skipping insertion in model container [2025-02-05 22:25:29,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:25:29" (3/3) ... [2025-02-05 22:25:29,834 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2025-02-05 22:25:29,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:25:29,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:25:29,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:25:29,901 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;@4e444f2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:25:29,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:25:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:25:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 22:25:29,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:29,912 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:29,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:29,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 869088949, now seen corresponding path program 1 times [2025-02-05 22:25:29,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:25:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723757204] [2025-02-05 22:25:29,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:29,925 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-02-05 22:25:29,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:25:29,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 22:25:29,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:25:30,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 22:25:30,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 22:25:30,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:30,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:30,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:25:30,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:25:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2025-02-05 22:25:30,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:25:30,386 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:25:30,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723757204] [2025-02-05 22:25:30,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723757204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:30,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:30,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:25:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51811352] [2025-02-05 22:25:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:30,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:25:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:25:30,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:25:30,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:25:30,410 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:25:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:30,438 INFO L93 Difference]: Finished difference Result 166 states and 291 transitions. [2025-02-05 22:25:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:25:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 192 [2025-02-05 22:25:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:30,445 INFO L225 Difference]: With dead ends: 166 [2025-02-05 22:25:30,445 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 22:25:30,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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-02-05 22:25:30,450 INFO L435 NwaCegarLoop]: 128 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, 128 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-02-05 22:25:30,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:25:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 22:25:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-05 22:25:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:25:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2025-02-05 22:25:30,491 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 192 [2025-02-05 22:25:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:30,492 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2025-02-05 22:25:30,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:25:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2025-02-05 22:25:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 22:25:30,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:30,497 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:30,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:25:30,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 22:25:30,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:30,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash -112210245, now seen corresponding path program 1 times [2025-02-05 22:25:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:25:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239676317] [2025-02-05 22:25:30,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:30,703 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-02-05 22:25:30,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:25:30,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 22:25:30,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:25:30,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 22:25:31,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 22:25:31,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:31,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:31,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:25:31,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:25:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:31,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:25:31,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:25:31,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239676317] [2025-02-05 22:25:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239676317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:31,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:31,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:25:31,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694753837] [2025-02-05 22:25:31,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:31,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:25:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:25:31,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:25:31,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:25:31,134 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:35,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:25:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:35,281 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2025-02-05 22:25:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:25:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2025-02-05 22:25:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:35,313 INFO L225 Difference]: With dead ends: 163 [2025-02-05 22:25:35,313 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 22:25:35,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 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-02-05 22:25:35,314 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:35,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 22:25:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 22:25:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-05 22:25:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:25:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2025-02-05 22:25:35,321 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 192 [2025-02-05 22:25:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:35,322 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2025-02-05 22:25:35,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2025-02-05 22:25:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 22:25:35,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:35,325 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:35,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 22:25:35,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 22:25:35,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:35,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1001859085, now seen corresponding path program 1 times [2025-02-05 22:25:35,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:25:35,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21632840] [2025-02-05 22:25:35,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:35,528 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-02-05 22:25:35,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:25:35,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 22:25:35,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 22:25:35,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 22:25:35,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 22:25:35,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:35,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:35,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:25:35,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:25:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:25:38,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:25:38,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:25:38,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21632840] [2025-02-05 22:25:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21632840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:25:38,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:25:38,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:25:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207137511] [2025-02-05 22:25:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:25:38,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:25:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:25:38,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:25:38,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:25:38,302 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:41,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:25:44,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:25:46,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:25:50,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:25:54,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:25:58,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:25:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:25:58,868 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2025-02-05 22:25:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:25:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2025-02-05 22:25:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:25:58,901 INFO L225 Difference]: With dead ends: 348 [2025-02-05 22:25:58,901 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 22:25:58,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:25:58,902 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 255 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:25:58,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 465 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 385 Invalid, 2 Unknown, 0 Unchecked, 20.3s Time] [2025-02-05 22:25:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 22:25:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 218. [2025-02-05 22:25:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 124 states have internal predecessors, (157), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 22:25:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 337 transitions. [2025-02-05 22:25:58,947 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 337 transitions. Word has length 193 [2025-02-05 22:25:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:25:58,948 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 337 transitions. [2025-02-05 22:25:58,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:25:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 337 transitions. [2025-02-05 22:25:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 22:25:58,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:25:58,952 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:25:58,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 22:25:59,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-05 22:25:59,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:25:59,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:25:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash 496300460, now seen corresponding path program 1 times [2025-02-05 22:25:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:25:59,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390803802] [2025-02-05 22:25:59,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:25:59,160 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-02-05 22:25:59,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:25:59,165 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-05 22:25:59,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 22:25:59,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 22:25:59,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 22:25:59,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:25:59,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:25:59,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 22:25:59,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:26:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 60 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-02-05 22:26:01,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:26:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:26:01,727 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:26:01,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390803802] [2025-02-05 22:26:01,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390803802] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:26:01,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:26:01,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2025-02-05 22:26:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241532427] [2025-02-05 22:26:01,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:26:01,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:26:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:26:01,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:26:01,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:26:01,729 INFO L87 Difference]: Start difference. First operand 218 states and 337 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-05 22:26:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:26:02,558 INFO L93 Difference]: Finished difference Result 406 states and 607 transitions. [2025-02-05 22:26:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:26:02,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 193 [2025-02-05 22:26:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:26:02,564 INFO L225 Difference]: With dead ends: 406 [2025-02-05 22:26:02,564 INFO L226 Difference]: Without dead ends: 248 [2025-02-05 22:26:02,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:26:02,567 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 143 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:26:02,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 199 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:26:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-05 22:26:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2025-02-05 22:26:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 142 states have (on average 1.1901408450704225) internal successors, (169), 142 states have internal predecessors, (169), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 22:26:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 349 transitions. [2025-02-05 22:26:02,597 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 349 transitions. Word has length 193 [2025-02-05 22:26:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:26:02,598 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 349 transitions. [2025-02-05 22:26:02,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-05 22:26:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 349 transitions. [2025-02-05 22:26:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 22:26:02,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:26:02,602 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:26:02,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-02-05 22:26:02,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-05 22:26:02,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:26:02,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:26:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1705509749, now seen corresponding path program 1 times [2025-02-05 22:26:02,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:26:02,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888667265] [2025-02-05 22:26:02,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:02,808 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-02-05 22:26:02,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:26:02,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-05 22:26:02,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Waiting until timeout for monitored process [2025-02-05 22:26:02,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 22:26:03,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 22:26:03,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:03,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:03,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 22:26:03,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:26:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 593 proven. 69 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2025-02-05 22:26:05,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:26:07,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:26:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888667265] [2025-02-05 22:26:07,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888667265] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:26:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [414054434] [2025-02-05 22:26:07,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:07,817 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:26:07,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:26:07,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:26:07,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-02-05 22:26:07,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 22:26:08,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 22:26:08,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:08,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:08,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:26:08,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:26:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:26:10,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:26:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [414054434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:26:10,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:26:10,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-05 22:26:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186065643] [2025-02-05 22:26:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:26:10,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:26:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:26:10,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:26:10,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:26:10,183 INFO L87 Difference]: Start difference. First operand 242 states and 349 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:26:14,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:26:16,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:26:17,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:26:22,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:26:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:26:22,587 INFO L93 Difference]: Finished difference Result 570 states and 815 transitions. [2025-02-05 22:26:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:26:22,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2025-02-05 22:26:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:26:22,594 INFO L225 Difference]: With dead ends: 570 [2025-02-05 22:26:22,594 INFO L226 Difference]: Without dead ends: 396 [2025-02-05 22:26:22,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:26:22,597 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 79 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:26:22,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 343 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2025-02-05 22:26:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-05 22:26:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 390. [2025-02-05 22:26:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 250 states have (on average 1.236) internal successors, (309), 252 states have internal predecessors, (309), 124 states have call successors, (124), 15 states have call predecessors, (124), 15 states have return successors, (124), 122 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 22:26:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 557 transitions. [2025-02-05 22:26:22,663 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 557 transitions. Word has length 195 [2025-02-05 22:26:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:26:22,668 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 557 transitions. [2025-02-05 22:26:22,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:26:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 557 transitions. [2025-02-05 22:26:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 22:26:22,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:26:22,669 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:26:22,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2025-02-05 22:26:22,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Forceful destruction successful, exit code 0 [2025-02-05 22:26:23,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/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-02-05 22:26:23,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:26:23,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:26:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1603799797, now seen corresponding path program 1 times [2025-02-05 22:26:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:26:23,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320250016] [2025-02-05 22:26:23,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:26:23,072 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-02-05 22:26:23,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:26:23,075 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-02-05 22:26:23,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (8)] Waiting until timeout for monitored process [2025-02-05 22:26:23,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 22:26:23,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 22:26:23,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:26:23,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:26:23,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:26:23,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:26:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:26:25,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:26:25,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:26:25,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320250016] [2025-02-05 22:26:25,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320250016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:26:25,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:26:25,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:26:25,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242142015] [2025-02-05 22:26:25,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:26:25,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:26:25,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:26:25,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:26:25,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:26:25,441 INFO L87 Difference]: Start difference. First operand 390 states and 557 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 22:26:27,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:26:28,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []