./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.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_fillercodesize_normal_file-47.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 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:00:14,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:00:14,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:00:14,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:00:14,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:00:14,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:00:14,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:00:14,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:00:14,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:00:14,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:00:14,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:00:14,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:00:14,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:00:14,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:00:14,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:00:14,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:00:14,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:00:14,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:00:14,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:00:14,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:00:14,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:00:14,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:00:14,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:00:14,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:00:14,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:00:14,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:00:14,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:00:14,132 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 -> 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 [2025-02-05 21:00:14,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:00:14,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:00:14,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:00:14,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:00:14,368 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:00:14,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i [2025-02-05 21:00:15,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f268066/e38d1893abf44fea828c27b59b25365d/FLAGaed96f954 [2025-02-05 21:00:15,778 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:00:15,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i [2025-02-05 21:00:15,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f268066/e38d1893abf44fea828c27b59b25365d/FLAGaed96f954 [2025-02-05 21:00:15,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f268066/e38d1893abf44fea828c27b59b25365d [2025-02-05 21:00:15,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:00:15,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:00:15,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:00:15,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:00:15,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:00:15,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:00:15" (1/1) ... [2025-02-05 21:00:15,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22fc74b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:15, skipping insertion in model container [2025-02-05 21:00:15,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:00:15" (1/1) ... [2025-02-05 21:00:15,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:00:15,893 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_fillercodesize_normal_file-47.i[913,926] [2025-02-05 21:00:15,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:00:15,956 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:00:15,966 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_fillercodesize_normal_file-47.i[913,926] [2025-02-05 21:00:16,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:00:16,018 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:00:16,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16 WrapperNode [2025-02-05 21:00:16,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:00:16,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:00:16,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:00:16,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:00:16,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,072 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2025-02-05 21:00:16,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:00:16,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:00:16,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:00:16,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:00:16,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,109 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 21:00:16,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:00:16,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:00:16,134 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:00:16,134 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:00:16,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (1/1) ... [2025-02-05 21:00:16,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:00:16,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:00:16,161 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 21:00:16,170 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 21:00:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:00:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:00:16,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:00:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:00:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:00:16,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:00:16,245 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:00:16,247 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:00:16,582 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~bitwise19#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2025-02-05 21:00:16,612 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 21:00:16,614 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:00:16,632 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:00:16,633 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:00:16,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:00:16 BoogieIcfgContainer [2025-02-05 21:00:16,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:00:16,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:00:16,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:00:16,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:00:16,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:00:15" (1/3) ... [2025-02-05 21:00:16,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36473209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:00:16, skipping insertion in model container [2025-02-05 21:00:16,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:16" (2/3) ... [2025-02-05 21:00:16,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36473209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:00:16, skipping insertion in model container [2025-02-05 21:00:16,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:00:16" (3/3) ... [2025-02-05 21:00:16,641 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-47.i [2025-02-05 21:00:16,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:00:16,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-47.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:00:16,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:00:16,703 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;@661f2c9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:00:16,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:00:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 64 states have (on average 1.46875) internal successors, (94), 65 states have internal predecessors, (94), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 21:00:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 21:00:16,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:16,715 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:16,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:16,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash 608017030, now seen corresponding path program 1 times [2025-02-05 21:00:16,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:16,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581698167] [2025-02-05 21:00:16,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:16,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:16,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 21:00:16,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 21:00:16,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:16,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-05 21:00:16,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:16,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581698167] [2025-02-05 21:00:16,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581698167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:00:16,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655884289] [2025-02-05 21:00:16,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:16,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:00:16,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:00:16,923 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 21:00:16,924 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 21:00:16,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 21:00:17,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 21:00:17,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:17,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:17,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:00:17,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:00:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-05 21:00:17,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:00:17,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655884289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:00:17,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:00:17,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:00:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164782612] [2025-02-05 21:00:17,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:00:17,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:00:17,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:17,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:00:17,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:00:17,094 INFO L87 Difference]: Start difference. First operand has 88 states, 64 states have (on average 1.46875) internal successors, (94), 65 states have internal predecessors, (94), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 21:00:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:17,138 INFO L93 Difference]: Finished difference Result 170 states and 288 transitions. [2025-02-05 21:00:17,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:00:17,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2025-02-05 21:00:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:17,150 INFO L225 Difference]: With dead ends: 170 [2025-02-05 21:00:17,150 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 21:00:17,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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 21:00:17,158 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:17,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:00:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 21:00:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-05 21:00:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 21:00:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2025-02-05 21:00:17,207 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 140 [2025-02-05 21:00:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:17,208 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2025-02-05 21:00:17,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 21:00:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2025-02-05 21:00:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 21:00:17,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:17,214 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:17,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:00:17,414 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 21:00:17,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 991873300, now seen corresponding path program 1 times [2025-02-05 21:00:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:17,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106811773] [2025-02-05 21:00:17,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:17,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 21:00:17,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 21:00:17,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:17,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 21:00:17,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:17,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106811773] [2025-02-05 21:00:17,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106811773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:00:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:00:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:00:17,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122762296] [2025-02-05 21:00:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:00:17,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:00:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:17,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:00:17,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:00:17,992 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:18,234 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2025-02-05 21:00:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:00:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2025-02-05 21:00:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:18,236 INFO L225 Difference]: With dead ends: 363 [2025-02-05 21:00:18,236 INFO L226 Difference]: Without dead ends: 281 [2025-02-05 21:00:18,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:00:18,237 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 291 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:18,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 490 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:00:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-05 21:00:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 177. [2025-02-05 21:00:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.371212121212121) internal successors, (181), 132 states have internal predecessors, (181), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:00:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2025-02-05 21:00:18,258 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 141 [2025-02-05 21:00:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:18,258 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2025-02-05 21:00:18,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2025-02-05 21:00:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 21:00:18,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:18,260 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:18,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:00:18,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:18,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:18,261 INFO L85 PathProgramCache]: Analyzing trace with hash 147401429, now seen corresponding path program 1 times [2025-02-05 21:00:18,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:18,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19207892] [2025-02-05 21:00:18,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:18,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 21:00:18,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 21:00:18,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:18,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 21:00:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19207892] [2025-02-05 21:00:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19207892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:00:18,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:00:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:00:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398065517] [2025-02-05 21:00:18,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:00:18,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:00:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:18,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:00:18,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:00:18,621 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:18,872 INFO L93 Difference]: Finished difference Result 342 states and 509 transitions. [2025-02-05 21:00:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:00:18,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2025-02-05 21:00:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:18,874 INFO L225 Difference]: With dead ends: 342 [2025-02-05 21:00:18,874 INFO L226 Difference]: Without dead ends: 168 [2025-02-05 21:00:18,875 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 21:00:18,875 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 88 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:18,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 333 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:00:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-05 21:00:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2025-02-05 21:00:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:00:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2025-02-05 21:00:18,897 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 141 [2025-02-05 21:00:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2025-02-05 21:00:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2025-02-05 21:00:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 21:00:18,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:18,899 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:18,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:00:18,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1869987533, now seen corresponding path program 1 times [2025-02-05 21:00:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279440291] [2025-02-05 21:00:18,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:18,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 21:00:18,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 21:00:18,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 21:00:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279440291] [2025-02-05 21:00:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279440291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:00:19,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:00:19,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:00:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918644545] [2025-02-05 21:00:19,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:00:19,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:00:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:19,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:00:19,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:00:19,262 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:19,717 INFO L93 Difference]: Finished difference Result 398 states and 595 transitions. [2025-02-05 21:00:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:00:19,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2025-02-05 21:00:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:19,720 INFO L225 Difference]: With dead ends: 398 [2025-02-05 21:00:19,720 INFO L226 Difference]: Without dead ends: 316 [2025-02-05 21:00:19,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:00:19,721 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 163 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:19,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 547 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:00:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-02-05 21:00:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2025-02-05 21:00:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 192 states have (on average 1.3333333333333333) internal successors, (256), 192 states have internal predecessors, (256), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-05 21:00:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 382 transitions. [2025-02-05 21:00:19,747 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 382 transitions. Word has length 143 [2025-02-05 21:00:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:19,748 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 382 transitions. [2025-02-05 21:00:19,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 382 transitions. [2025-02-05 21:00:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 21:00:19,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:19,749 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:19,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:00:19,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:19,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1375912781, now seen corresponding path program 1 times [2025-02-05 21:00:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952930658] [2025-02-05 21:00:19,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:19,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:19,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 21:00:19,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 21:00:19,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:19,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 21:00:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952930658] [2025-02-05 21:00:20,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952930658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:00:20,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:00:20,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:00:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776953132] [2025-02-05 21:00:20,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:00:20,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:00:20,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:20,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:00:20,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:00:20,005 INFO L87 Difference]: Start difference. First operand 259 states and 382 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:20,277 INFO L93 Difference]: Finished difference Result 716 states and 1063 transitions. [2025-02-05 21:00:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:00:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-02-05 21:00:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:20,280 INFO L225 Difference]: With dead ends: 716 [2025-02-05 21:00:20,280 INFO L226 Difference]: Without dead ends: 527 [2025-02-05 21:00:20,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:00:20,281 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 270 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:20,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 496 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:00:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-05 21:00:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 386. [2025-02-05 21:00:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 307 states have (on average 1.3680781758957654) internal successors, (420), 308 states have internal predecessors, (420), 73 states have call successors, (73), 5 states have call predecessors, (73), 5 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-05 21:00:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 566 transitions. [2025-02-05 21:00:20,324 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 566 transitions. Word has length 144 [2025-02-05 21:00:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:20,324 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 566 transitions. [2025-02-05 21:00:20,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 566 transitions. [2025-02-05 21:00:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 21:00:20,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:20,326 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:20,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:00:20,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 102013386, now seen corresponding path program 1 times [2025-02-05 21:00:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772446867] [2025-02-05 21:00:20,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:20,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 21:00:20,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 21:00:20,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:20,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-02-05 21:00:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772446867] [2025-02-05 21:00:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772446867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:00:20,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164120333] [2025-02-05 21:00:20,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:20,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:00:20,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:00:20,866 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 21:00:20,869 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 21:00:20,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 21:00:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 21:00:21,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:21,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:21,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 21:00:21,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:00:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 312 proven. 126 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-02-05 21:00:22,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:00:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-02-05 21:00:23,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164120333] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:00:23,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:00:23,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2025-02-05 21:00:23,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663093632] [2025-02-05 21:00:23,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:00:23,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 21:00:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:23,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 21:00:23,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-02-05 21:00:23,057 INFO L87 Difference]: Start difference. First operand 386 states and 566 transitions. Second operand has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2025-02-05 21:00:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:27,335 INFO L93 Difference]: Finished difference Result 1109 states and 1543 transitions. [2025-02-05 21:00:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-02-05 21:00:27,336 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) Word has length 144 [2025-02-05 21:00:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:27,340 INFO L225 Difference]: With dead ends: 1109 [2025-02-05 21:00:27,340 INFO L226 Difference]: Without dead ends: 795 [2025-02-05 21:00:27,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4262 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2656, Invalid=10000, Unknown=0, NotChecked=0, Total=12656 [2025-02-05 21:00:27,345 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1466 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 2712 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 2712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:27,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1840 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 2712 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 21:00:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-05 21:00:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 447. [2025-02-05 21:00:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 353 states have (on average 1.3087818696883853) internal successors, (462), 355 states have internal predecessors, (462), 75 states have call successors, (75), 18 states have call predecessors, (75), 18 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 21:00:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 612 transitions. [2025-02-05 21:00:27,416 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 612 transitions. Word has length 144 [2025-02-05 21:00:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:27,416 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 612 transitions. [2025-02-05 21:00:27,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2025-02-05 21:00:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 612 transitions. [2025-02-05 21:00:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 21:00:27,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:27,417 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:27,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:00:27,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:00:27,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:27,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1121146483, now seen corresponding path program 1 times [2025-02-05 21:00:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143308832] [2025-02-05 21:00:27,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:27,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 21:00:27,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 21:00:27,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:27,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 21:00:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:27,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143308832] [2025-02-05 21:00:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143308832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:00:27,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:00:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:00:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557763838] [2025-02-05 21:00:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:00:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:00:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:27,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:00:27,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:00:27,861 INFO L87 Difference]: Start difference. First operand 447 states and 612 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:28,127 INFO L93 Difference]: Finished difference Result 864 states and 1190 transitions. [2025-02-05 21:00:28,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:00:28,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2025-02-05 21:00:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:28,131 INFO L225 Difference]: With dead ends: 864 [2025-02-05 21:00:28,131 INFO L226 Difference]: Without dead ends: 637 [2025-02-05 21:00:28,132 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 21:00:28,132 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 188 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:28,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 364 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:00:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-05 21:00:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 571. [2025-02-05 21:00:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 475 states have internal predecessors, (624), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 21:00:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 780 transitions. [2025-02-05 21:00:28,188 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 780 transitions. Word has length 145 [2025-02-05 21:00:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:28,189 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 780 transitions. [2025-02-05 21:00:28,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:00:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 780 transitions. [2025-02-05 21:00:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 21:00:28,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:28,190 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:28,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:00:28,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:28,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash 696884649, now seen corresponding path program 1 times [2025-02-05 21:00:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037892786] [2025-02-05 21:00:28,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:28,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 21:00:28,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 21:00:28,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:28,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 21:00:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037892786] [2025-02-05 21:00:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037892786] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:00:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715279860] [2025-02-05 21:00:28,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:00:28,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:00:28,368 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 21:00:28,369 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 21:00:28,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 21:00:28,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 21:00:28,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:28,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:28,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 21:00:28,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:00:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 188 proven. 102 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-05 21:00:29,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:00:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 21:00:29,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715279860] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:00:29,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:00:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 18 [2025-02-05 21:00:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8977854] [2025-02-05 21:00:29,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:00:29,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:00:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:29,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:00:29,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:00:29,343 INFO L87 Difference]: Start difference. First operand 571 states and 780 transitions. Second operand has 18 states, 18 states have (on average 5.5) internal successors, (99), 17 states have internal predecessors, (99), 6 states have call successors, (60), 4 states have call predecessors, (60), 7 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) [2025-02-05 21:00:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:29,799 INFO L93 Difference]: Finished difference Result 982 states and 1334 transitions. [2025-02-05 21:00:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:00:29,800 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.5) internal successors, (99), 17 states have internal predecessors, (99), 6 states have call successors, (60), 4 states have call predecessors, (60), 7 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) Word has length 145 [2025-02-05 21:00:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:29,803 INFO L225 Difference]: With dead ends: 982 [2025-02-05 21:00:29,803 INFO L226 Difference]: Without dead ends: 489 [2025-02-05 21:00:29,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2025-02-05 21:00:29,806 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 278 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:29,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 810 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:00:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-05 21:00:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 389. [2025-02-05 21:00:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 297 states have (on average 1.2558922558922558) internal successors, (373), 298 states have internal predecessors, (373), 73 states have call successors, (73), 18 states have call predecessors, (73), 18 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-05 21:00:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 519 transitions. [2025-02-05 21:00:29,892 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 519 transitions. Word has length 145 [2025-02-05 21:00:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 519 transitions. [2025-02-05 21:00:29,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.5) internal successors, (99), 17 states have internal predecessors, (99), 6 states have call successors, (60), 4 states have call predecessors, (60), 7 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) [2025-02-05 21:00:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 519 transitions. [2025-02-05 21:00:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 21:00:29,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:29,893 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:29,900 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 21:00:30,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:00:30,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:30,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1448915760, now seen corresponding path program 1 times [2025-02-05 21:00:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:30,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946728530] [2025-02-05 21:00:30,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:30,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 21:00:30,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 21:00:30,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:30,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 66 proven. 96 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-02-05 21:00:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946728530] [2025-02-05 21:00:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946728530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:00:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825560288] [2025-02-05 21:00:30,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:30,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:00:30,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:00:30,651 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 21:00:30,653 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 21:00:30,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 21:00:30,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 21:00:30,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:30,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:30,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 21:00:30,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:00:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 290 proven. 48 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-02-05 21:00:31,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:00:31,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825560288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:00:31,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:00:31,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2025-02-05 21:00:31,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931269386] [2025-02-05 21:00:31,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:00:31,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:00:31,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:31,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:00:31,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-02-05 21:00:31,546 INFO L87 Difference]: Start difference. First operand 389 states and 519 transitions. Second operand has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 16 states have internal predecessors, (83), 5 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 7 states have call predecessors, (39), 5 states have call successors, (39) [2025-02-05 21:00:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:33,281 INFO L93 Difference]: Finished difference Result 939 states and 1232 transitions. [2025-02-05 21:00:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-05 21:00:33,281 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 16 states have internal predecessors, (83), 5 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 7 states have call predecessors, (39), 5 states have call successors, (39) Word has length 146 [2025-02-05 21:00:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:33,285 INFO L225 Difference]: With dead ends: 939 [2025-02-05 21:00:33,285 INFO L226 Difference]: Without dead ends: 760 [2025-02-05 21:00:33,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=846, Invalid=3186, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 21:00:33,288 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 721 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:33,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 943 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:00:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-02-05 21:00:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 432. [2025-02-05 21:00:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 337 states have (on average 1.2373887240356083) internal successors, (417), 338 states have internal predecessors, (417), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-05 21:00:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 563 transitions. [2025-02-05 21:00:33,355 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 563 transitions. Word has length 146 [2025-02-05 21:00:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:33,355 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 563 transitions. [2025-02-05 21:00:33,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 16 states have internal predecessors, (83), 5 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 7 states have call predecessors, (39), 5 states have call successors, (39) [2025-02-05 21:00:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 563 transitions. [2025-02-05 21:00:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 21:00:33,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:33,357 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:33,365 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 21:00:33,561 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,SelfDestructingSolverStorable8 [2025-02-05 21:00:33,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:33,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:33,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1709190272, now seen corresponding path program 1 times [2025-02-05 21:00:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:33,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912916796] [2025-02-05 21:00:33,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:33,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:33,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 21:00:33,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 21:00:33,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:33,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:00:33,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528279009] [2025-02-05 21:00:33,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:33,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:00:33,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:00:33,614 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 21:00:33,619 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 21:00:33,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 21:00:33,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 21:00:33,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:33,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:33,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 21:00:33,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:00:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 174 proven. 99 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2025-02-05 21:00:34,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:00:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:00:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912916796] [2025-02-05 21:00:34,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:00:34,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528279009] [2025-02-05 21:00:34,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528279009] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:00:34,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:00:34,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-05 21:00:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021994173] [2025-02-05 21:00:34,351 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:00:34,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:00:34,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:00:34,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:00:34,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:00:34,351 INFO L87 Difference]: Start difference. First operand 432 states and 563 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 21:00:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:34,581 INFO L93 Difference]: Finished difference Result 790 states and 1034 transitions. [2025-02-05 21:00:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:00:34,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 146 [2025-02-05 21:00:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:34,583 INFO L225 Difference]: With dead ends: 790 [2025-02-05 21:00:34,583 INFO L226 Difference]: Without dead ends: 442 [2025-02-05 21:00:34,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:00:34,585 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 93 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:00:34,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 538 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:00:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-02-05 21:00:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 434. [2025-02-05 21:00:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 339 states have (on average 1.2359882005899705) internal successors, (419), 340 states have internal predecessors, (419), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-05 21:00:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 565 transitions. [2025-02-05 21:00:34,639 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 565 transitions. Word has length 146 [2025-02-05 21:00:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:34,639 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 565 transitions. [2025-02-05 21:00:34,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 21:00:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 565 transitions. [2025-02-05 21:00:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 21:00:34,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:34,640 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:34,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 21:00:34,840 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,SelfDestructingSolverStorable9 [2025-02-05 21:00:34,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:34,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1698273343, now seen corresponding path program 1 times [2025-02-05 21:00:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:00:34,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560802253] [2025-02-05 21:00:34,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:34,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:00:34,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 21:00:34,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 21:00:34,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:34,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:00:34,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713759393] [2025-02-05 21:00:34,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:34,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:00:34,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:00:34,888 INFO L229 MonitoredProcess]: Starting monitored process 7 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 21:00:34,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 21:00:34,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 21:00:35,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 21:00:35,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:35,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:00:35,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 21:00:35,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 21:00:35,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 21:00:35,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:35,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:00:35,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 21:00:35,137 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 21:00:35,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 21:00:35,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 21:00:35,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 21:00:35,342 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:00:35,395 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 21:00:35,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 09:00:35 BoogieIcfgContainer [2025-02-05 21:00:35,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 21:00:35,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 21:00:35,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 21:00:35,398 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 21:00:35,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:00:16" (3/4) ... [2025-02-05 21:00:35,400 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 21:00:35,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 21:00:35,401 INFO L158 Benchmark]: Toolchain (without parser) took 19599.51ms. Allocated memory was 201.3MB in the beginning and 436.2MB in the end (delta: 234.9MB). Free memory was 158.1MB in the beginning and 311.7MB in the end (delta: -153.6MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2025-02-05 21:00:35,401 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 209.7MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:00:35,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.75ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 143.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:00:35,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.42ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 138.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:00:35,401 INFO L158 Benchmark]: Boogie Preprocessor took 57.00ms. Allocated memory is still 201.3MB. Free memory was 138.7MB in the beginning and 133.1MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:00:35,401 INFO L158 Benchmark]: IcfgBuilder took 500.03ms. Allocated memory is still 201.3MB. Free memory was 133.1MB in the beginning and 104.8MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 21:00:35,402 INFO L158 Benchmark]: TraceAbstraction took 18761.61ms. Allocated memory was 201.3MB in the beginning and 436.2MB in the end (delta: 234.9MB). Free memory was 103.9MB in the beginning and 311.8MB in the end (delta: -207.9MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-02-05 21:00:35,402 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 436.2MB. Free memory was 311.8MB in the beginning and 311.7MB in the end (delta: 138.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:00:35,403 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.28ms. Allocated memory is still 209.7MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.75ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 143.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.42ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 138.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.00ms. Allocated memory is still 201.3MB. Free memory was 138.7MB in the beginning and 133.1MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 500.03ms. Allocated memory is still 201.3MB. Free memory was 133.1MB in the beginning and 104.8MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18761.61ms. Allocated memory was 201.3MB in the beginning and 436.2MB in the end (delta: 234.9MB). Free memory was 103.9MB in the beginning and 311.8MB in the end (delta: -207.9MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 436.2MB. Free memory was 311.8MB in the beginning and 311.7MB in the end (delta: 138.5kB). 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 someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of bitwiseOr at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] unsigned char last_1_var_1_8 = 64; [L42] unsigned char last_1_var_1_19 = 1; [L43] unsigned short int last_1_var_1_20 = 256; [L44] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_8 = var_1_8 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_20 = var_1_20 [L130] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L96] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L98] var_1_5 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L101] var_1_6 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_8=64, var_1_9=5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_8=64, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L104] var_1_9 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L122] var_1_21 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L49] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L53] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=16383, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L54] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L59] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=114686, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L60] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L61] COND TRUE \read(var_1_16) [L62] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L69] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L70] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L76] COND TRUE var_1_12 >= (1.3 / var_1_3) [L77] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L81] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L82] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L83] COND TRUE stepLocal_1 || var_1_16 [L84] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L133-L134] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 11, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3570 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3558 mSDsluCounter, 6484 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4929 mSDsCounter, 1117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5781 IncrementalHoareTripleChecker+Invalid, 6898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1117 mSolverCounterUnsat, 1555 mSDtfsCounter, 5781 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1403 GetRequests, 1173 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5361 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=571occurred in iteration=7, InterpolantAutomatonStates: 196, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1183 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2448 NumberOfCodeBlocks, 2448 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2283 ConstructedInterpolants, 0 QuantifiedInterpolants, 12293 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 12716/13440 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 21:00:35,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_fillercodesize_normal_file-47.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 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:00:37,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:00:37,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 21:00:37,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:00:37,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:00:37,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:00:37,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:00:37,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:00:37,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:00:37,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:00:37,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:00:37,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:00:37,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:00:37,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:00:37,570 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:00:37,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:00:37,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:00:37,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:00:37,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:00:37,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:00:37,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:00:37,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:00:37,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:00:37,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:00:37,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:00:37,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:00:37,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:00:37,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:00:37,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:00:37,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:00:37,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:00:37,573 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 21:00:37,573 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 21:00:37,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:00:37,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:00:37,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:00:37,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:00:37,573 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 -> 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 [2025-02-05 21:00:37,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:00:37,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:00:37,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:00:37,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:00:37,812 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:00:37,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i [2025-02-05 21:00:38,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/494877644/51f3c45c647d484a923780aa4c602c8b/FLAGa25343a42 [2025-02-05 21:00:39,201 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:00:39,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i [2025-02-05 21:00:39,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/494877644/51f3c45c647d484a923780aa4c602c8b/FLAGa25343a42 [2025-02-05 21:00:39,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/494877644/51f3c45c647d484a923780aa4c602c8b [2025-02-05 21:00:39,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:00:39,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:00:39,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:00:39,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:00:39,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:00:39,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27914ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39, skipping insertion in model container [2025-02-05 21:00:39,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:00:39,346 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_fillercodesize_normal_file-47.i[913,926] [2025-02-05 21:00:39,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:00:39,422 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:00:39,430 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_fillercodesize_normal_file-47.i[913,926] [2025-02-05 21:00:39,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:00:39,472 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:00:39,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39 WrapperNode [2025-02-05 21:00:39,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:00:39,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:00:39,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:00:39,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:00:39,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,516 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-02-05 21:00:39,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:00:39,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:00:39,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:00:39,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:00:39,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,545 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 21:00:39,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:00:39,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:00:39,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:00:39,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:00:39,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (1/1) ... [2025-02-05 21:00:39,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:00:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:00:39,601 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 21:00:39,606 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 21:00:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:00:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 21:00:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:00:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:00:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:00:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:00:39,691 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:00:39,693 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:00:52,754 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 21:00:52,755 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:00:52,761 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:00:52,762 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:00:52,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:00:52 BoogieIcfgContainer [2025-02-05 21:00:52,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:00:52,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:00:52,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:00:52,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:00:52,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:00:39" (1/3) ... [2025-02-05 21:00:52,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504d7b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:00:52, skipping insertion in model container [2025-02-05 21:00:52,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:00:39" (2/3) ... [2025-02-05 21:00:52,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504d7b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:00:52, skipping insertion in model container [2025-02-05 21:00:52,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:00:52" (3/3) ... [2025-02-05 21:00:52,771 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-47.i [2025-02-05 21:00:52,782 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:00:52,783 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-47.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:00:52,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:00:52,833 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;@b91bbdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:00:52,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:00:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 21:00:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 21:00:52,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:52,843 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:52,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:52,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1133708336, now seen corresponding path program 1 times [2025-02-05 21:00:52,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:00:52,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586277683] [2025-02-05 21:00:52,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:52,860 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 21:00:52,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:00:52,863 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 21:00:52,868 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 21:00:52,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 21:00:53,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 21:00:53,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:53,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:53,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:00:53,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:00:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-02-05 21:00:53,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:00:53,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:00:53,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586277683] [2025-02-05 21:00:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586277683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:00:53,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:00:53,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:00:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169428277] [2025-02-05 21:00:53,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:00:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:00:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:00:53,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:00:53,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:00:53,711 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 21:00:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:00:53,753 INFO L93 Difference]: Finished difference Result 124 states and 212 transitions. [2025-02-05 21:00:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:00:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2025-02-05 21:00:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:00:53,770 INFO L225 Difference]: With dead ends: 124 [2025-02-05 21:00:53,771 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 21:00:53,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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 21:00:53,784 INFO L435 NwaCegarLoop]: 93 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, 93 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 21:00:53,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:00:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 21:00:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-05 21:00:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 21:00:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2025-02-05 21:00:53,853 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 136 [2025-02-05 21:00:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:00:53,857 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2025-02-05 21:00:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 21:00:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2025-02-05 21:00:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 21:00:53,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:00:53,861 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:53,879 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 21:00:54,062 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 21:00:54,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:00:54,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:00:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash -848457165, now seen corresponding path program 1 times [2025-02-05 21:00:54,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:00:54,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224312383] [2025-02-05 21:00:54,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:54,066 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 21:00:54,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:00:54,069 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 21:00:54,070 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 21:00:54,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 21:00:54,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 21:00:54,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:54,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:54,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 21:00:54,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:00:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-02-05 21:00:57,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:00:57,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:00:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224312383] [2025-02-05 21:00:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224312383] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:00:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [826249587] [2025-02-05 21:00:57,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:00:57,614 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 21:00:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 21:00:57,638 INFO L229 MonitoredProcess]: Starting monitored process 4 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 21:00:57,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-05 21:00:57,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 21:00:58,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 21:00:58,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:00:58,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:00:58,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 21:00:58,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:01:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 21:01:01,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:01:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [826249587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:01:01,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:01:01,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 21:01:01,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318701809] [2025-02-05 21:01:01,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:01:01,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:01:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:01:01,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:01:01,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:01:01,647 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:01:06,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:10,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:13,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:17,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:01:18,028 INFO L93 Difference]: Finished difference Result 287 states and 433 transitions. [2025-02-05 21:01:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:01:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2025-02-05 21:01:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:01:18,035 INFO L225 Difference]: With dead ends: 287 [2025-02-05 21:01:18,035 INFO L226 Difference]: Without dead ends: 228 [2025-02-05 21:01:18,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:01:18,036 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 133 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:01:18,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 472 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 15.9s Time] [2025-02-05 21:01:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-05 21:01:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131. [2025-02-05 21:01:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:01:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2025-02-05 21:01:18,067 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 136 [2025-02-05 21:01:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:01:18,067 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2025-02-05 21:01:18,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:01:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2025-02-05 21:01:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 21:01:18,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:01:18,068 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:18,089 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 21:01:18,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-02-05 21:01:18,473 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 21:01:18,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:01:18,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:01:18,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1354015790, now seen corresponding path program 1 times [2025-02-05 21:01:18,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:01:18,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364794422] [2025-02-05 21:01:18,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:01:18,474 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 21:01:18,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:01:18,477 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 21:01:18,479 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 21:01:18,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 21:01:19,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 21:01:19,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:01:19,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:01:19,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:01:19,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:01:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 21:01:26,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:01:26,216 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:01:26,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364794422] [2025-02-05 21:01:26,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364794422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:01:26,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:01:26,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:01:26,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375930530] [2025-02-05 21:01:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:01:26,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:01:26,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:01:26,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:01:26,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:01:26,218 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 21:01:30,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:34,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:39,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:41,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:01:49,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []