./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.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_loopvsstraightlinecode_100-1loop_file-59.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 18f661507baa99a6860677d13bda352b5068a9ab896ed00822695643614eba74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:49:06,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:49:06,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:49:06,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:49:06,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:49:06,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:49:06,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:49:06,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:49:06,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:49:06,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:49:06,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:49:06,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:49:06,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:49:06,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:49:06,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:49:06,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:49:06,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:49:06,302 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 -> 18f661507baa99a6860677d13bda352b5068a9ab896ed00822695643614eba74 [2025-02-06 00:49:06,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:49:06,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:49:06,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:49:06,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:49:06,569 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:49:06,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-02-06 00:49:07,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dc240838/864ed2907c304b0f95b8e0bd1a2fa853/FLAGa2f438254 [2025-02-06 00:49:08,157 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:49:08,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-02-06 00:49:08,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dc240838/864ed2907c304b0f95b8e0bd1a2fa853/FLAGa2f438254 [2025-02-06 00:49:08,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dc240838/864ed2907c304b0f95b8e0bd1a2fa853 [2025-02-06 00:49:08,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:49:08,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:49:08,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:49:08,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:49:08,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:49:08,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdb7764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08, skipping insertion in model container [2025-02-06 00:49:08,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:49:08,435 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_loopvsstraightlinecode_100-1loop_file-59.i[916,929] [2025-02-06 00:49:08,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:49:08,527 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:49:08,535 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_loopvsstraightlinecode_100-1loop_file-59.i[916,929] [2025-02-06 00:49:08,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:49:08,578 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:49:08,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08 WrapperNode [2025-02-06 00:49:08,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:49:08,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:49:08,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:49:08,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:49:08,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,656 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2025-02-06 00:49:08,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:49:08,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:49:08,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:49:08,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:49:08,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,702 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-06 00:49:08,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:49:08,743 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:49:08,743 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:49:08,744 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:49:08,745 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (1/1) ... [2025-02-06 00:49:08,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:49:08,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:08,779 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-06 00:49:08,786 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-06 00:49:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:49:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:49:08,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:49:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:49:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:49:08,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:49:08,880 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:49:08,882 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:49:09,381 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L167: havoc property_#t~ite23#1;havoc property_#t~bitwise20#1;havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short24#1;havoc property_#t~bitwise25#1;havoc property_#t~bitwise26#1;havoc property_#t~short27#1; [2025-02-06 00:49:09,430 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-06 00:49:09,431 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:49:09,454 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:49:09,455 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:49:09,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:09 BoogieIcfgContainer [2025-02-06 00:49:09,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:49:09,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:49:09,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:49:09,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:49:09,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:49:08" (1/3) ... [2025-02-06 00:49:09,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b9cd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:49:09, skipping insertion in model container [2025-02-06 00:49:09,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:08" (2/3) ... [2025-02-06 00:49:09,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b9cd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:49:09, skipping insertion in model container [2025-02-06 00:49:09,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:09" (3/3) ... [2025-02-06 00:49:09,464 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-02-06 00:49:09,474 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:49:09,476 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-59.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:49:09,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:49:09,525 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;@194a56a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:49:09,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:49:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 86 states have internal predecessors, (129), 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-06 00:49:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 00:49:09,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:09,541 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, 1, 1] [2025-02-06 00:49:09,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:09,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 493103717, now seen corresponding path program 1 times [2025-02-06 00:49:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650819688] [2025-02-06 00:49:09,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:09,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 00:49:09,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 00:49:09,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:09,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:09,791 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-06 00:49:09,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650819688] [2025-02-06 00:49:09,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650819688] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495087] [2025-02-06 00:49:09,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:09,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:09,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:09,795 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-06 00:49:09,796 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-06 00:49:09,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 00:49:09,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 00:49:09,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:09,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:09,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:49:09,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:49:09,929 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-06 00:49:09,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:49:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:49:09,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:49:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571788593] [2025-02-06 00:49:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:09,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:49:09,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:09,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:49:09,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:49:09,948 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 86 states have internal predecessors, (129), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-06 00:49:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:09,977 INFO L93 Difference]: Finished difference Result 215 states and 360 transitions. [2025-02-06 00:49:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:49:09,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (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 148 [2025-02-06 00:49:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:09,984 INFO L225 Difference]: With dead ends: 215 [2025-02-06 00:49:09,984 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 00:49:09,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-06 00:49:09,988 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:09,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:49:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 00:49:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 00:49:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 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-06 00:49:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 165 transitions. [2025-02-06 00:49:10,024 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 165 transitions. Word has length 148 [2025-02-06 00:49:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:10,025 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 165 transitions. [2025-02-06 00:49:10,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (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-06 00:49:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 165 transitions. [2025-02-06 00:49:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 00:49:10,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:10,030 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, 1, 1] [2025-02-06 00:49:10,040 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-06 00:49:10,235 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-06 00:49:10,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:10,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1983510392, now seen corresponding path program 1 times [2025-02-06 00:49:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704877857] [2025-02-06 00:49:10,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:10,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:10,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 00:49:10,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 00:49:10,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:10,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:10,444 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-06 00:49:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704877857] [2025-02-06 00:49:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704877857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:10,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:10,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:49:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608725401] [2025-02-06 00:49:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:10,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:49:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:10,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:49:10,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:10,447 INFO L87 Difference]: Start difference. First operand 106 states and 165 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-06 00:49:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:10,531 INFO L93 Difference]: Finished difference Result 309 states and 483 transitions. [2025-02-06 00:49:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:49:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 148 [2025-02-06 00:49:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:10,535 INFO L225 Difference]: With dead ends: 309 [2025-02-06 00:49:10,535 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 00:49:10,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:10,539 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 144 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:10,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 279 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:49:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 00:49:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2025-02-06 00:49:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.440251572327044) internal successors, (229), 159 states have internal predecessors, (229), 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-06 00:49:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2025-02-06 00:49:10,574 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 148 [2025-02-06 00:49:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:10,575 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2025-02-06 00:49:10,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-06 00:49:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2025-02-06 00:49:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 00:49:10,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:10,577 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, 1, 1, 1] [2025-02-06 00:49:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:49:10,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:10,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash 175183162, now seen corresponding path program 1 times [2025-02-06 00:49:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102930026] [2025-02-06 00:49:10,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:10,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 00:49:10,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 00:49:10,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:10,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:10,901 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-06 00:49:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102930026] [2025-02-06 00:49:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102930026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:10,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:10,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:49:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190138446] [2025-02-06 00:49:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:10,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:49:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:10,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:49:10,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:10,903 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-06 00:49:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:10,981 INFO L93 Difference]: Finished difference Result 405 states and 623 transitions. [2025-02-06 00:49:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:49:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 149 [2025-02-06 00:49:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:10,985 INFO L225 Difference]: With dead ends: 405 [2025-02-06 00:49:10,985 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 00:49:10,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:10,986 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:10,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:49:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 00:49:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 00:49:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.4276729559748427) internal successors, (227), 159 states have internal predecessors, (227), 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-06 00:49:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 311 transitions. [2025-02-06 00:49:11,014 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 311 transitions. Word has length 149 [2025-02-06 00:49:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:11,015 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 311 transitions. [2025-02-06 00:49:11,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-06 00:49:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 311 transitions. [2025-02-06 00:49:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 00:49:11,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:11,021 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, 1, 1, 1, 1] [2025-02-06 00:49:11,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:49:11,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:11,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 573243416, now seen corresponding path program 1 times [2025-02-06 00:49:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171761782] [2025-02-06 00:49:11,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:11,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 00:49:11,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 00:49:11,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:11,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:11,350 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-06 00:49:11,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:11,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171761782] [2025-02-06 00:49:11,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171761782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:11,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:11,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:49:11,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546153305] [2025-02-06 00:49:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:11,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:49:11,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:11,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:49:11,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:49:11,354 INFO L87 Difference]: Start difference. First operand 204 states and 311 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-06 00:49:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:11,402 INFO L93 Difference]: Finished difference Result 409 states and 625 transitions. [2025-02-06 00:49:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:49:11,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 150 [2025-02-06 00:49:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:11,406 INFO L225 Difference]: With dead ends: 409 [2025-02-06 00:49:11,407 INFO L226 Difference]: Without dead ends: 208 [2025-02-06 00:49:11,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:49:11,409 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:11,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:49:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-06 00:49:11,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-02-06 00:49:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 163 states have (on average 1.4171779141104295) internal successors, (231), 163 states have internal predecessors, (231), 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-06 00:49:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 315 transitions. [2025-02-06 00:49:11,438 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 315 transitions. Word has length 150 [2025-02-06 00:49:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:11,438 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 315 transitions. [2025-02-06 00:49:11,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-06 00:49:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 315 transitions. [2025-02-06 00:49:11,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 00:49:11,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:11,443 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, 1, 1, 1, 1] [2025-02-06 00:49:11,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:49:11,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:11,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1234211047, now seen corresponding path program 1 times [2025-02-06 00:49:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466574481] [2025-02-06 00:49:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 00:49:11,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 00:49:11,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:11,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:11,778 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-06 00:49:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:11,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466574481] [2025-02-06 00:49:11,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466574481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:11,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:11,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:49:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540368408] [2025-02-06 00:49:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:49:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:11,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:49:11,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:49:11,781 INFO L87 Difference]: Start difference. First operand 208 states and 315 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-06 00:49:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:12,037 INFO L93 Difference]: Finished difference Result 527 states and 798 transitions. [2025-02-06 00:49:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:49:12,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 150 [2025-02-06 00:49:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:12,040 INFO L225 Difference]: With dead ends: 527 [2025-02-06 00:49:12,041 INFO L226 Difference]: Without dead ends: 322 [2025-02-06 00:49:12,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:49:12,042 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 114 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:12,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 582 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:49:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-06 00:49:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2025-02-06 00:49:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 252 states have (on average 1.4047619047619047) internal successors, (354), 252 states have internal predecessors, (354), 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-06 00:49:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 480 transitions. [2025-02-06 00:49:12,077 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 480 transitions. Word has length 150 [2025-02-06 00:49:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 480 transitions. [2025-02-06 00:49:12,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-06 00:49:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 480 transitions. [2025-02-06 00:49:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 00:49:12,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:12,081 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, 1, 1, 1, 1] [2025-02-06 00:49:12,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:49:12,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:12,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash -792214744, now seen corresponding path program 1 times [2025-02-06 00:49:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:12,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587057231] [2025-02-06 00:49:12,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:12,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 00:49:12,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 00:49:12,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:12,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:12,769 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-06 00:49:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:12,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587057231] [2025-02-06 00:49:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587057231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:12,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:49:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467027054] [2025-02-06 00:49:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:49:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:12,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:49:12,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:49:12,771 INFO L87 Difference]: Start difference. First operand 319 states and 480 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-06 00:49:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:13,115 INFO L93 Difference]: Finished difference Result 834 states and 1254 transitions. [2025-02-06 00:49:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:49:13,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 150 [2025-02-06 00:49:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:13,118 INFO L225 Difference]: With dead ends: 834 [2025-02-06 00:49:13,118 INFO L226 Difference]: Without dead ends: 518 [2025-02-06 00:49:13,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:49:13,119 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 79 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:13,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 308 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:49:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-06 00:49:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 441. [2025-02-06 00:49:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 374 states have (on average 1.4438502673796791) internal successors, (540), 374 states have internal predecessors, (540), 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-06 00:49:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 666 transitions. [2025-02-06 00:49:13,149 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 666 transitions. Word has length 150 [2025-02-06 00:49:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:13,149 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 666 transitions. [2025-02-06 00:49:13,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-06 00:49:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 666 transitions. [2025-02-06 00:49:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 00:49:13,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:13,152 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, 1, 1, 1, 1] [2025-02-06 00:49:13,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:49:13,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:13,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1046951289, now seen corresponding path program 1 times [2025-02-06 00:49:13,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:13,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479314125] [2025-02-06 00:49:13,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:13,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:13,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 00:49:13,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 00:49:13,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:13,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:13,283 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-06 00:49:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479314125] [2025-02-06 00:49:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479314125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:13,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:49:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421273801] [2025-02-06 00:49:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:13,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:49:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:13,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:49:13,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:49:13,285 INFO L87 Difference]: Start difference. First operand 441 states and 666 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-06 00:49:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:13,478 INFO L93 Difference]: Finished difference Result 1371 states and 2059 transitions. [2025-02-06 00:49:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:49:13,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 150 [2025-02-06 00:49:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:13,483 INFO L225 Difference]: With dead ends: 1371 [2025-02-06 00:49:13,483 INFO L226 Difference]: Without dead ends: 933 [2025-02-06 00:49:13,484 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-06 00:49:13,484 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 218 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:13,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 516 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:49:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-06 00:49:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 755. [2025-02-06 00:49:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 622 states have (on average 1.4212218649517685) internal successors, (884), 622 states have internal predecessors, (884), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-06 00:49:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1136 transitions. [2025-02-06 00:49:13,537 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1136 transitions. Word has length 150 [2025-02-06 00:49:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:13,537 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1136 transitions. [2025-02-06 00:49:13,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-06 00:49:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1136 transitions. [2025-02-06 00:49:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 00:49:13,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:13,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:49:13,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:13,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1580977915, now seen corresponding path program 1 times [2025-02-06 00:49:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062115067] [2025-02-06 00:49:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:13,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 00:49:13,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 00:49:13,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:13,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:15,764 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-06 00:49:15,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062115067] [2025-02-06 00:49:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062115067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747544577] [2025-02-06 00:49:15,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:15,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:15,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:15,769 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-06 00:49:15,770 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-06 00:49:15,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 00:49:15,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 00:49:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:15,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 00:49:15,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:49:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:49:15,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:49:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747544577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:15,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:49:15,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2025-02-06 00:49:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211743107] [2025-02-06 00:49:15,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:49:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:15,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:49:15,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-02-06 00:49:15,993 INFO L87 Difference]: Start difference. First operand 755 states and 1136 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:49:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:16,287 INFO L93 Difference]: Finished difference Result 1027 states and 1521 transitions. [2025-02-06 00:49:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:49:16,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2025-02-06 00:49:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:16,289 INFO L225 Difference]: With dead ends: 1027 [2025-02-06 00:49:16,289 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 00:49:16,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-02-06 00:49:16,291 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 225 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:16,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 293 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:49:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 00:49:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2025-02-06 00:49:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 217 states have (on average 1.336405529953917) internal successors, (290), 217 states have internal predecessors, (290), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:49:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 374 transitions. [2025-02-06 00:49:16,316 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 374 transitions. Word has length 155 [2025-02-06 00:49:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:16,318 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 374 transitions. [2025-02-06 00:49:16,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:49:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 374 transitions. [2025-02-06 00:49:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 00:49:16,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:16,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:16,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 00:49:16,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:16,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:16,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:16,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1251790841, now seen corresponding path program 1 times [2025-02-06 00:49:16,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:16,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508338159] [2025-02-06 00:49:16,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:16,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:16,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 00:49:16,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 00:49:16,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:16,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:16,587 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-06 00:49:16,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:16,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508338159] [2025-02-06 00:49:16,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508338159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:16,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:16,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:49:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159483674] [2025-02-06 00:49:16,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:16,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:49:16,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:16,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:49:16,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:16,589 INFO L87 Difference]: Start difference. First operand 264 states and 374 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-06 00:49:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:16,728 INFO L93 Difference]: Finished difference Result 736 states and 1051 transitions. [2025-02-06 00:49:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:49:16,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 156 [2025-02-06 00:49:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:16,732 INFO L225 Difference]: With dead ends: 736 [2025-02-06 00:49:16,732 INFO L226 Difference]: Without dead ends: 475 [2025-02-06 00:49:16,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:49:16,733 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 116 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:16,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 247 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:49:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-02-06 00:49:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 367. [2025-02-06 00:49:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 320 states have (on average 1.35) internal successors, (432), 320 states have internal predecessors, (432), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:49:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 516 transitions. [2025-02-06 00:49:16,760 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 516 transitions. Word has length 156 [2025-02-06 00:49:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:16,761 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 516 transitions. [2025-02-06 00:49:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-06 00:49:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 516 transitions. [2025-02-06 00:49:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 00:49:16,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:16,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:16,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 00:49:16,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:16,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1718699801, now seen corresponding path program 1 times [2025-02-06 00:49:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:16,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698205290] [2025-02-06 00:49:16,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:16,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:49:16,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:49:16,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:16,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:16,874 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-06 00:49:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:16,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698205290] [2025-02-06 00:49:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698205290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:49:16,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:49:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:49:16,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244765820] [2025-02-06 00:49:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:49:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:49:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:16,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:49:16,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:49:16,876 INFO L87 Difference]: Start difference. First operand 367 states and 516 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-06 00:49:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:17,140 INFO L93 Difference]: Finished difference Result 956 states and 1351 transitions. [2025-02-06 00:49:17,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:49:17,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 157 [2025-02-06 00:49:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:17,146 INFO L225 Difference]: With dead ends: 956 [2025-02-06 00:49:17,146 INFO L226 Difference]: Without dead ends: 592 [2025-02-06 00:49:17,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:49:17,147 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 112 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:17,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 473 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:49:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-06 00:49:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 436. [2025-02-06 00:49:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 389 states have internal predecessors, (534), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:49:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 618 transitions. [2025-02-06 00:49:17,181 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 618 transitions. Word has length 157 [2025-02-06 00:49:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:17,181 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 618 transitions. [2025-02-06 00:49:17,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-06 00:49:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 618 transitions. [2025-02-06 00:49:17,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 00:49:17,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:17,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:17,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:49:17,184 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:17,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1919848769, now seen corresponding path program 1 times [2025-02-06 00:49:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980545611] [2025-02-06 00:49:17,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:17,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:49:17,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:49:17,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:17,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:20,413 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-06 00:49:20,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980545611] [2025-02-06 00:49:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980545611] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:20,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377056335] [2025-02-06 00:49:20,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:20,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:20,416 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-06 00:49:20,418 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-06 00:49:20,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:49:20,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:49:20,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:20,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:20,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 00:49:20,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:49:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-02-06 00:49:21,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:49:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377056335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:22,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:49:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2025-02-06 00:49:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242227134] [2025-02-06 00:49:22,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:49:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 00:49:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:22,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 00:49:22,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-02-06 00:49:22,206 INFO L87 Difference]: Start difference. First operand 436 states and 618 transitions. Second operand has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-06 00:49:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:25,873 INFO L93 Difference]: Finished difference Result 1269 states and 1752 transitions. [2025-02-06 00:49:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 00:49:25,874 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 157 [2025-02-06 00:49:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:25,877 INFO L225 Difference]: With dead ends: 1269 [2025-02-06 00:49:25,877 INFO L226 Difference]: Without dead ends: 836 [2025-02-06 00:49:25,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=501, Invalid=2469, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 00:49:25,879 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1478 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:25,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 490 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 00:49:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-02-06 00:49:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 567. [2025-02-06 00:49:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 514 states have (on average 1.3249027237354085) internal successors, (681), 514 states have internal predecessors, (681), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:49:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 765 transitions. [2025-02-06 00:49:25,911 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 765 transitions. Word has length 157 [2025-02-06 00:49:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:25,911 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 765 transitions. [2025-02-06 00:49:25,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-06 00:49:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 765 transitions. [2025-02-06 00:49:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 00:49:25,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:25,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:25,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 00:49:26,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:26,114 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:26,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1983897565, now seen corresponding path program 1 times [2025-02-06 00:49:26,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:26,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737345071] [2025-02-06 00:49:26,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:26,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:26,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 00:49:26,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 00:49:26,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:26,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:28,619 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-06 00:49:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737345071] [2025-02-06 00:49:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737345071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:28,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669471753] [2025-02-06 00:49:28,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:28,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:28,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:28,626 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-06 00:49:28,643 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-06 00:49:28,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 00:49:28,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 00:49:28,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:28,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:28,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 00:49:28,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:49:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 182 proven. 108 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-06 00:49:31,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:49:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669471753] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:35,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:49:35,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 24 [2025-02-06 00:49:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881535652] [2025-02-06 00:49:35,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:49:35,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 00:49:35,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:35,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 00:49:35,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 00:49:35,432 INFO L87 Difference]: Start difference. First operand 567 states and 765 transitions. Second operand has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 3 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-06 00:49:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:39,997 INFO L93 Difference]: Finished difference Result 1583 states and 2110 transitions. [2025-02-06 00:49:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 00:49:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 3 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 159 [2025-02-06 00:49:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:40,005 INFO L225 Difference]: With dead ends: 1583 [2025-02-06 00:49:40,005 INFO L226 Difference]: Without dead ends: 1019 [2025-02-06 00:49:40,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=683, Invalid=3349, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 00:49:40,012 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 980 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:40,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 678 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 00:49:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-02-06 00:49:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 608. [2025-02-06 00:49:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 555 states have (on average 1.3315315315315315) internal successors, (739), 555 states have internal predecessors, (739), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:49:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 823 transitions. [2025-02-06 00:49:40,046 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 823 transitions. Word has length 159 [2025-02-06 00:49:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:40,047 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 823 transitions. [2025-02-06 00:49:40,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 3 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-06 00:49:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 823 transitions. [2025-02-06 00:49:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 00:49:40,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:40,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:40,055 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-06 00:49:40,249 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,SelfDestructingSolverStorable11 [2025-02-06 00:49:40,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:40,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash -788625757, now seen corresponding path program 1 times [2025-02-06 00:49:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:40,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6746250] [2025-02-06 00:49:40,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:40,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 00:49:40,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 00:49:40,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:43,182 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-06 00:49:43,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:49:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6746250] [2025-02-06 00:49:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6746250] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571604132] [2025-02-06 00:49:43,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:43,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:43,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:43,189 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-06 00:49:43,190 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-06 00:49:43,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 00:49:43,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 00:49:43,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:43,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:49:43,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 00:49:43,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:49:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 182 proven. 108 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-06 00:49:43,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:49:44,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571604132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:49:44,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:49:44,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2025-02-06 00:49:44,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647971675] [2025-02-06 00:49:44,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:49:44,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 00:49:44,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:49:44,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 00:49:44,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2025-02-06 00:49:44,104 INFO L87 Difference]: Start difference. First operand 608 states and 823 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 3 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-06 00:49:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:49:47,839 INFO L93 Difference]: Finished difference Result 1369 states and 1851 transitions. [2025-02-06 00:49:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 00:49:47,840 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 3 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 159 [2025-02-06 00:49:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:49:47,843 INFO L225 Difference]: With dead ends: 1369 [2025-02-06 00:49:47,843 INFO L226 Difference]: Without dead ends: 764 [2025-02-06 00:49:47,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=473, Invalid=2607, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 00:49:47,845 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 808 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:49:47,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 781 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 00:49:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-02-06 00:49:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 446. [2025-02-06 00:49:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 393 states have (on average 1.3384223918575064) internal successors, (526), 393 states have internal predecessors, (526), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:49:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 610 transitions. [2025-02-06 00:49:47,874 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 610 transitions. Word has length 159 [2025-02-06 00:49:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:49:47,874 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 610 transitions. [2025-02-06 00:49:47,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 3 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-06 00:49:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 610 transitions. [2025-02-06 00:49:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 00:49:47,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:49:47,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:47,884 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-06 00:49:48,076 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,SelfDestructingSolverStorable12 [2025-02-06 00:49:48,077 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:49:48,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:49:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash -293183350, now seen corresponding path program 1 times [2025-02-06 00:49:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:49:48,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684044384] [2025-02-06 00:49:48,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:49:48,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 00:49:48,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 00:49:48,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:48,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:49:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41379638] [2025-02-06 00:49:48,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:49:48,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:49:48,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:48,215 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-06 00:49:48,219 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-06 00:49:48,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 00:49:48,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 00:49:48,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:48,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:49:48,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:49:48,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 00:49:48,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 00:49:48,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:49:48,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:49:48,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:49:48,528 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:49:48,529 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:49:48,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 00:49:48,731 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,SelfDestructingSolverStorable13 [2025-02-06 00:49:48,734 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:49:48,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:49:48,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:49:48 BoogieIcfgContainer [2025-02-06 00:49:48,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:49:48,799 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:49:48,799 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:49:48,799 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:49:48,799 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:09" (3/4) ... [2025-02-06 00:49:48,801 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:49:48,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:49:48,802 INFO L158 Benchmark]: Toolchain (without parser) took 40590.94ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 105.1MB in the beginning and 664.3MB in the end (delta: -559.2MB). Peak memory consumption was 288.2MB. Max. memory is 16.1GB. [2025-02-06 00:49:48,802 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:49:48,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.93ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 88.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:49:48,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.18ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 80.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:49:48,803 INFO L158 Benchmark]: Boogie Preprocessor took 83.90ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 71.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:49:48,803 INFO L158 Benchmark]: IcfgBuilder took 712.28ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 95.7MB in the end (delta: -24.5MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2025-02-06 00:49:48,803 INFO L158 Benchmark]: TraceAbstraction took 39341.14ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 94.9MB in the beginning and 664.5MB in the end (delta: -569.6MB). Peak memory consumption was 280.8MB. Max. memory is 16.1GB. [2025-02-06 00:49:48,803 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 989.9MB. Free memory was 664.5MB in the beginning and 664.3MB in the end (delta: 207.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:49:48,804 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.93ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 88.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.18ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 80.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.90ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 71.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 712.28ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 95.7MB in the end (delta: -24.5MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 39341.14ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 94.9MB in the beginning and 664.5MB in the end (delta: -569.6MB). Peak memory consumption was 280.8MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 989.9MB. Free memory was 664.5MB in the beginning and 664.3MB in the end (delta: 207.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 167, overapproximation of shiftRight at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 155. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 50; [L23] unsigned char var_1_5 = 200; [L24] unsigned char var_1_6 = 64; [L25] signed short int var_1_7 = -2; [L26] signed long int var_1_8 = 16; [L27] unsigned char var_1_11 = 1; [L28] signed char var_1_12 = 8; [L29] signed char var_1_13 = 0; [L30] signed char var_1_14 = 10; [L31] signed char var_1_15 = 8; [L32] unsigned char var_1_16 = 5; [L33] unsigned char var_1_17 = 100; [L34] unsigned char var_1_18 = 25; [L35] unsigned char var_1_19 = 0; [L36] signed short int var_1_20 = -128; [L37] signed short int var_1_21 = -8; [L38] double var_1_22 = 100000000000.35; [L39] double var_1_23 = 199.4; [L40] double var_1_24 = 63.5; [L41] signed short int var_1_25 = 1; [L42] unsigned char var_1_27 = 1; [L43] unsigned char var_1_28 = 0; [L44] signed short int var_1_29 = -8; [L45] signed long int last_1_var_1_8 = 16; [L46] unsigned char last_1_var_1_16 = 5; VAL [isInitial=0, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L171] isInitial = 1 [L172] FCALL initially() [L173] int k_loop; [L174] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L174] COND TRUE k_loop < 1 [L175] CALL updateLastVariables() [L163] last_1_var_1_8 = var_1_8 [L164] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L128] var_1_5 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_5 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=64, var_1_7=-2, var_1_8=16] [L129] RET assume_abort_if_not(var_1_5 >= 190) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=64, var_1_7=-2, var_1_8=16] [L131] var_1_6 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_7=-2, var_1_8=16] [L132] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_7=-2, var_1_8=16] [L133] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L133] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L134] var_1_13 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L135] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L136] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L136] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L137] var_1_14 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L138] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L139] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L139] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L140] var_1_15 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L141] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L142] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L142] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L143] var_1_17 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_17 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L144] RET assume_abort_if_not(var_1_17 >= 95) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L145] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L145] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L146] var_1_18 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L147] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L148] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L148] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L149] var_1_19 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L150] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L151] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L151] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L152] var_1_22 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L153] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L154] var_1_23 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L155] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L156] var_1_24 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L157] RET assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L158] var_1_28 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L159] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L160] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L160] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L176] RET updateVariables() [L177] CALL step() [L50] COND TRUE (last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16 [L51] var_1_1 = ((var_1_5 - 2) - var_1_6) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L55] COND TRUE 100.5f < var_1_22 [L56] var_1_27 = (! var_1_28) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L58] COND TRUE var_1_27 || var_1_27 [L59] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L61] signed long int stepLocal_5 = 2; [L62] unsigned char stepLocal_4 = var_1_5; [L63] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_4=469, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L64] COND FALSE !(stepLocal_4 <= var_1_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L67] COND TRUE stepLocal_3 || var_1_27 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=16] [L68] COND TRUE stepLocal_5 < var_1_1 [L69] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L73] COND FALSE !(! var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L80] signed long int stepLocal_2 = ~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))); VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-105, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L81] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-105, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L81] signed long int stepLocal_1 = var_1_11 >> var_1_1; [L82] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, stepLocal_1=0, stepLocal_2=-105, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L83] COND TRUE var_1_5 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, stepLocal_1=0, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L84] COND FALSE !(var_1_1 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L94] COND TRUE (var_1_22 * -0.625) < (var_1_23 * var_1_24) [L95] var_1_21 = ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L101] COND FALSE !(var_1_7 > var_1_5) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L106] COND TRUE \read(var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L107] COND FALSE !(var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=5, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L117] COND TRUE var_1_15 > var_1_25 [L118] var_1_16 = (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L120] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L120] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=-128, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L120] signed long int stepLocal_6 = (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))); [L121] COND FALSE !(stepLocal_6 > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) [L124] var_1_20 = ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=104, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L177] RET step() [L178] CALL, EXPR property() [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR (var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L167-L168] return ((((((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16))))) && (((var_1_22 * -0.625) < (var_1_23 * var_1_24)) ? (var_1_21 == ((signed short int) ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))))) : (var_1_27 ? (var_1_21 == ((signed short int) (((((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) > ((var_1_13 + var_1_6))) ? ((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) : ((var_1_13 + var_1_6)))))) : 1))) && (var_1_27 ? ((var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) ? (var_1_27 ? (var_1_25 == ((signed short int) var_1_17)) : (var_1_25 == ((signed short int) var_1_18))) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((100.5f < var_1_22) ? (var_1_27 == ((unsigned char) (! var_1_28))) : 1)) && ((var_1_7 > var_1_5) ? (((var_1_21 <= var_1_6) || (var_1_27 || var_1_27)) ? (var_1_29 == ((signed short int) var_1_17)) : 1) : 1) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=3, var_1_14=-3, var_1_15=63, var_1_16=104, var_1_17=-146, var_1_18=257, var_1_19=0, var_1_1=104, var_1_20=110, var_1_21=3, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=469, var_1_6=-149, var_1_7=-2, var_1_8=107] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.2s, OverallIterations: 14, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4281 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4276 mSDsluCounter, 5536 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3635 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7693 IncrementalHoareTripleChecker+Invalid, 8001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 1901 mSDtfsCounter, 7693 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1401 GetRequests, 1188 SyntacticMatches, 3 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2734 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=755occurred in iteration=7, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1533 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 3090 NumberOfCodeBlocks, 3090 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2748 ConstructedInterpolants, 0 QuantifiedInterpolants, 27685 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1819 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 14489/15120 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-06 00:49:49,013 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-06 00:49:49,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_loopvsstraightlinecode_100-1loop_file-59.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 18f661507baa99a6860677d13bda352b5068a9ab896ed00822695643614eba74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:49:50,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:49:50,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:49:50,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:49:50,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:49:51,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:49:51,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:49:51,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:49:51,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:49:51,012 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:49:51,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:49:51,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:49:51,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:49:51,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:49:51,013 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:49:51,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:49:51,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:49:51,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:49:51,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:49:51,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:49:51,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:49:51,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:49:51,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:49:51,014 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:49:51,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:49:51,015 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:49:51,015 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:49:51,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:49:51,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:49:51,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:49:51,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:49:51,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:49:51,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:49:51,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:49:51,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:49:51,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:49:51,017 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 -> 18f661507baa99a6860677d13bda352b5068a9ab896ed00822695643614eba74 [2025-02-06 00:49:51,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:49:51,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:49:51,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:49:51,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:49:51,309 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:49:51,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-02-06 00:49:52,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fcc3f0a7/8e6653571a654716b5ae3ac8cc912d31/FLAG0e45d59a0 [2025-02-06 00:49:52,881 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:49:52,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-02-06 00:49:52,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fcc3f0a7/8e6653571a654716b5ae3ac8cc912d31/FLAG0e45d59a0 [2025-02-06 00:49:52,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fcc3f0a7/8e6653571a654716b5ae3ac8cc912d31 [2025-02-06 00:49:52,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:49:52,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:49:52,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:49:52,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:49:52,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:49:52,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:49:52" (1/1) ... [2025-02-06 00:49:52,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c2f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:52, skipping insertion in model container [2025-02-06 00:49:52,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:49:52" (1/1) ... [2025-02-06 00:49:52,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:49:53,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.i[916,929] [2025-02-06 00:49:53,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:49:53,082 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:49:53,089 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_loopvsstraightlinecode_100-1loop_file-59.i[916,929] [2025-02-06 00:49:53,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:49:53,127 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:49:53,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53 WrapperNode [2025-02-06 00:49:53,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:49:53,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:49:53,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:49:53,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:49:53,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,170 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-02-06 00:49:53,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:49:53,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:49:53,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:49:53,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:49:53,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,203 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-06 00:49:53,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:49:53,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:49:53,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:49:53,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:49:53,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (1/1) ... [2025-02-06 00:49:53,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:49:53,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:49:53,275 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-06 00:49:53,285 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-06 00:49:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:49:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:49:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:49:53,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:49:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:49:53,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:49:53,379 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:49:53,380 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:50:04,721 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-06 00:50:04,721 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:50:04,731 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:50:04,732 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:50:04,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:04 BoogieIcfgContainer [2025-02-06 00:50:04,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:50:04,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:50:04,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:50:04,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:50:04,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:49:52" (1/3) ... [2025-02-06 00:50:04,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a7208a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:50:04, skipping insertion in model container [2025-02-06 00:50:04,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:53" (2/3) ... [2025-02-06 00:50:04,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a7208a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:50:04, skipping insertion in model container [2025-02-06 00:50:04,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:04" (3/3) ... [2025-02-06 00:50:04,739 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-02-06 00:50:04,748 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:50:04,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-59.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:50:04,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:50:04,795 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;@1fabebc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:50:04,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:50:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 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-06 00:50:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 00:50:04,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:04,805 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-06 00:50:04,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:04,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash -961998605, now seen corresponding path program 1 times [2025-02-06 00:50:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:50:04,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589067720] [2025-02-06 00:50:04,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:04,816 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-06 00:50:04,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:50:04,818 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-06 00:50:04,820 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-06 00:50:04,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 00:50:05,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 00:50:05,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:05,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:05,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:50:05,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:05,214 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-06 00:50:05,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:50:05,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:50:05,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589067720] [2025-02-06 00:50:05,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589067720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:05,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:05,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:50:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31412550] [2025-02-06 00:50:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:05,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:50:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:50:05,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:50:05,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:50:05,232 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-06 00:50:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:05,247 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2025-02-06 00:50:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:50:05,248 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 140 [2025-02-06 00:50:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:05,252 INFO L225 Difference]: With dead ends: 145 [2025-02-06 00:50:05,252 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 00:50:05,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-06 00:50:05,255 INFO L435 NwaCegarLoop]: 114 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, 114 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-06 00:50:05,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:50:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 00:50:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-06 00:50:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 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-06 00:50:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2025-02-06 00:50:05,279 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 140 [2025-02-06 00:50:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:05,280 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2025-02-06 00:50:05,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-06 00:50:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2025-02-06 00:50:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 00:50:05,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:05,283 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-06 00:50:05,293 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 (2)] Ended with exit code 0 [2025-02-06 00:50:05,487 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-06 00:50:05,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash -739196394, now seen corresponding path program 1 times [2025-02-06 00:50:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:50:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989846719] [2025-02-06 00:50:05,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:05,489 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-06 00:50:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:50:05,491 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-06 00:50:05,493 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-06 00:50:05,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 00:50:05,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 00:50:05,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:05,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:05,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 00:50:05,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:05,851 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-06 00:50:05,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:50:05,851 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:50:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989846719] [2025-02-06 00:50:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989846719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:05,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:50:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770598167] [2025-02-06 00:50:05,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:05,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:50:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:50:05,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:50:05,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:50:05,853 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-06 00:50:09,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 00:50:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:09,951 INFO L93 Difference]: Finished difference Result 139 states and 219 transitions. [2025-02-06 00:50:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:50:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 140 [2025-02-06 00:50:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:09,992 INFO L225 Difference]: With dead ends: 139 [2025-02-06 00:50:09,992 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 00:50:09,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:50:09,993 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:09,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 00:50:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 00:50:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-06 00:50:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 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-06 00:50:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2025-02-06 00:50:10,002 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 140 [2025-02-06 00:50:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:10,003 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2025-02-06 00:50:10,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-06 00:50:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2025-02-06 00:50:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 00:50:10,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:10,005 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-06 00:50:10,019 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-06 00:50:10,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 00:50:10,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:10,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:10,210 INFO L85 PathProgramCache]: Analyzing trace with hash 308589941, now seen corresponding path program 1 times [2025-02-06 00:50:10,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:50:10,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62094720] [2025-02-06 00:50:10,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:10,211 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-06 00:50:10,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:50:10,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 00:50:10,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 00:50:10,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 00:50:10,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 00:50:10,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:10,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:10,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 00:50:10,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 00:50:10,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:50:10,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:50:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62094720] [2025-02-06 00:50:10,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62094720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:10,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:10,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:50:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000104413] [2025-02-06 00:50:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:10,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:50:10,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:50:10,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:50:10,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:50:10,950 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:50:14,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:50:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:14,761 INFO L93 Difference]: Finished difference Result 146 states and 222 transitions. [2025-02-06 00:50:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:50:14,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2025-02-06 00:50:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:14,794 INFO L225 Difference]: With dead ends: 146 [2025-02-06 00:50:14,794 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 00:50:14,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:50:14,795 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 112 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:14,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 163 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-06 00:50:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 00:50:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-02-06 00:50:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 00:50:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2025-02-06 00:50:14,810 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 141 [2025-02-06 00:50:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:14,811 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2025-02-06 00:50:14,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 00:50:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2025-02-06 00:50:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 00:50:14,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:14,812 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] [2025-02-06 00:50:14,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 00:50:15,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 00:50:15,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash -616543410, now seen corresponding path program 1 times [2025-02-06 00:50:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:50:15,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57138825] [2025-02-06 00:50:15,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:15,016 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-06 00:50:15,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:50:15,022 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-06 00:50:15,023 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-06 00:50:15,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:50:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:50:15,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:15,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:15,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 00:50:15,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 182 proven. 108 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-06 00:50:17,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:18,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:50:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57138825] [2025-02-06 00:50:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57138825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2041424490] [2025-02-06 00:50:18,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:18,729 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 00:50:18,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 00:50:18,749 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 00:50:18,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-06 00:50:18,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:50:19,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:50:19,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:19,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:19,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 00:50:19,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 182 proven. 108 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-06 00:50:21,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2041424490] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:22,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:50:22,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2025-02-06 00:50:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782802890] [2025-02-06 00:50:22,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:22,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:50:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:50:22,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:50:22,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:50:22,072 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 00:50:28,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:50:31,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []