./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:22:46,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:22:46,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:22:46,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:22:46,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:22:46,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:22:46,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:22:46,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:22:46,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:22:46,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:22:46,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:22:46,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:22:46,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:22:46,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:22:46,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:22:46,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:22:46,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:22:46,293 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:22:46,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:22:46,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:22:46,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:22:46,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:22:46,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:22:46,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:22:46,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:22:46,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 [2025-03-17 01:22:46,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:22:46,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:22:46,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:22:46,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:22:46,520 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:22:46,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-03-17 01:22:47,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e492d442b/b69cac52ef8d45f6bbb7dbdcbf1fc2f8/FLAGee46102be [2025-03-17 01:22:47,833 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:22:47,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-03-17 01:22:47,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e492d442b/b69cac52ef8d45f6bbb7dbdcbf1fc2f8/FLAGee46102be [2025-03-17 01:22:48,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e492d442b/b69cac52ef8d45f6bbb7dbdcbf1fc2f8 [2025-03-17 01:22:48,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:22:48,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:22:48,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:22:48,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:22:48,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:22:48,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5a1271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48, skipping insertion in model container [2025-03-17 01:22:48,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:22:48,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2025-03-17 01:22:48,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:22:48,330 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:22:48,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2025-03-17 01:22:48,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:22:48,375 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:22:48,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48 WrapperNode [2025-03-17 01:22:48,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:22:48,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:22:48,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:22:48,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:22:48,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,412 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-17 01:22:48,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:22:48,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:22:48,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:22:48,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:22:48,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,436 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:22:48,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:22:48,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:22:48,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:22:48,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:22:48,452 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (1/1) ... [2025-03-17 01:22:48,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:22:48,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:22:48,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:22:48,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:22:48,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:22:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:22:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:22:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:22:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:22:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:22:48,545 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:22:48,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:22:48,903 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 01:22:48,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:22:48,912 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:22:48,912 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:22:48,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:22:48 BoogieIcfgContainer [2025-03-17 01:22:48,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:22:48,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:22:48,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:22:48,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:22:48,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:22:48" (1/3) ... [2025-03-17 01:22:48,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4565b4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:22:48, skipping insertion in model container [2025-03-17 01:22:48,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:22:48" (2/3) ... [2025-03-17 01:22:48,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4565b4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:22:48, skipping insertion in model container [2025-03-17 01:22:48,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:22:48" (3/3) ... [2025-03-17 01:22:48,921 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-03-17 01:22:48,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:22:48,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:22:48,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:22:48,979 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;@185c252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:22:48,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:22:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 01:22:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 01:22:48,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:22:48,995 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:22:48,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:22:48,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:22:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 758921721, now seen corresponding path program 1 times [2025-03-17 01:22:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:22:49,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923361488] [2025-03-17 01:22:49,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:22:49,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 01:22:49,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 01:22:49,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:49,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 01:22:49,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:22:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923361488] [2025-03-17 01:22:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923361488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:22:49,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842364394] [2025-03-17 01:22:49,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:49,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:22:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:22:49,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:22:49,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:22:49,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 01:22:49,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 01:22:49,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:49,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:49,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:22:49,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:22:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 01:22:49,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:22:49,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842364394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:22:49,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:22:49,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:22:49,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076495156] [2025-03-17 01:22:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:22:49,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:22:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:22:49,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:22:49,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:22:49,420 INFO L87 Difference]: Start difference. First operand has 66 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 01:22:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:22:49,434 INFO L93 Difference]: Finished difference Result 128 states and 226 transitions. [2025-03-17 01:22:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:22:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2025-03-17 01:22:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:22:49,438 INFO L225 Difference]: With dead ends: 128 [2025-03-17 01:22:49,439 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 01:22:49,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:22:49,442 INFO L435 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:22:49,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:22:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 01:22:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 01:22:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 01:22:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2025-03-17 01:22:49,466 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 125 [2025-03-17 01:22:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:22:49,466 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2025-03-17 01:22:49,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 01:22:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2025-03-17 01:22:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 01:22:49,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:22:49,468 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:22:49,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:22:49,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:22:49,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:22:49,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:22:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash -945169477, now seen corresponding path program 1 times [2025-03-17 01:22:49,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:22:49,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219087178] [2025-03-17 01:22:49,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:22:49,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 01:22:49,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 01:22:49,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:49,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:22:50,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:22:50,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219087178] [2025-03-17 01:22:50,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219087178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:22:50,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:22:50,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:22:50,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212003044] [2025-03-17 01:22:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:22:50,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:22:50,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:22:50,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:22:50,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:22:50,067 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:22:50,171 INFO L93 Difference]: Finished difference Result 188 states and 296 transitions. [2025-03-17 01:22:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:22:50,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2025-03-17 01:22:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:22:50,174 INFO L225 Difference]: With dead ends: 188 [2025-03-17 01:22:50,174 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 01:22:50,175 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-03-17 01:22:50,175 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 103 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:22:50,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 283 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:22:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 01:22:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2025-03-17 01:22:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 01:22:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2025-03-17 01:22:50,195 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 125 [2025-03-17 01:22:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:22:50,197 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2025-03-17 01:22:50,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2025-03-17 01:22:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:22:50,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:22:50,199 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:22:50,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:22:50,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:22:50,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:22:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash 494068937, now seen corresponding path program 1 times [2025-03-17 01:22:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:22:50,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425505442] [2025-03-17 01:22:50,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:22:50,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:22:50,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:22:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:22:50,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:22:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425505442] [2025-03-17 01:22:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425505442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:22:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:22:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:22:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444670194] [2025-03-17 01:22:50,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:22:50,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:22:50,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:22:50,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:22:50,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:22:50,378 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:22:50,446 INFO L93 Difference]: Finished difference Result 192 states and 293 transitions. [2025-03-17 01:22:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:22:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:22:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:22:50,450 INFO L225 Difference]: With dead ends: 192 [2025-03-17 01:22:50,450 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 01:22:50,450 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-03-17 01:22:50,451 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:22:50,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:22:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 01:22:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2025-03-17 01:22:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.380952380952381) internal successors, (116), 85 states have internal predecessors, (116), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 01:22:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 192 transitions. [2025-03-17 01:22:50,472 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 192 transitions. Word has length 126 [2025-03-17 01:22:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:22:50,473 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 192 transitions. [2025-03-17 01:22:50,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 192 transitions. [2025-03-17 01:22:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:22:50,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:22:50,476 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:22:50,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:22:50,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:22:50,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:22:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1013482872, now seen corresponding path program 1 times [2025-03-17 01:22:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:22:50,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919993759] [2025-03-17 01:22:50,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:50,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:22:50,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:22:50,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:22:50,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:22:50,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:22:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919993759] [2025-03-17 01:22:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919993759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:22:50,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:22:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:22:50,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607149626] [2025-03-17 01:22:50,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:22:50,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:22:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:22:50,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:22:50,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:22:50,732 INFO L87 Difference]: Start difference. First operand 127 states and 192 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:22:50,974 INFO L93 Difference]: Finished difference Result 352 states and 548 transitions. [2025-03-17 01:22:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:22:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:22:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:22:50,977 INFO L225 Difference]: With dead ends: 352 [2025-03-17 01:22:50,977 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 01:22:50,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:22:50,980 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 149 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:22:50,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 436 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:22:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 01:22:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 187. [2025-03-17 01:22:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 125 states have (on average 1.408) internal successors, (176), 126 states have internal predecessors, (176), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 01:22:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 288 transitions. [2025-03-17 01:22:51,028 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 288 transitions. Word has length 126 [2025-03-17 01:22:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:22:51,030 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 288 transitions. [2025-03-17 01:22:51,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 288 transitions. [2025-03-17 01:22:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:22:51,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:22:51,031 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:22:51,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:22:51,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:22:51,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:22:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 231281609, now seen corresponding path program 1 times [2025-03-17 01:22:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:22:51,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140753365] [2025-03-17 01:22:51,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:51,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:22:51,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:22:51,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:22:51,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:51,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:22:51,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:22:51,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140753365] [2025-03-17 01:22:51,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140753365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:22:51,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:22:51,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:22:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346341127] [2025-03-17 01:22:51,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:22:51,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:22:51,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:22:51,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:22:51,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:22:51,433 INFO L87 Difference]: Start difference. First operand 187 states and 288 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:22:51,648 INFO L93 Difference]: Finished difference Result 323 states and 488 transitions. [2025-03-17 01:22:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:22:51,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:22:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:22:51,651 INFO L225 Difference]: With dead ends: 323 [2025-03-17 01:22:51,651 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 01:22:51,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:22:51,652 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 114 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:22:51,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 311 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:22:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 01:22:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 191. [2025-03-17 01:22:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 130 states have internal predecessors, (182), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 01:22:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 294 transitions. [2025-03-17 01:22:51,674 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 294 transitions. Word has length 126 [2025-03-17 01:22:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:22:51,674 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 294 transitions. [2025-03-17 01:22:51,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 294 transitions. [2025-03-17 01:22:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:22:51,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:22:51,675 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:22:51,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:22:51,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:22:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:22:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1576172854, now seen corresponding path program 1 times [2025-03-17 01:22:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:22:51,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522244969] [2025-03-17 01:22:51,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:22:51,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:22:51,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:22:51,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:51,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:22:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:22:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522244969] [2025-03-17 01:22:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522244969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:22:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:22:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:22:51,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098895208] [2025-03-17 01:22:51,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:22:51,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:22:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:22:51,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:22:51,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:22:51,806 INFO L87 Difference]: Start difference. First operand 191 states and 294 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:22:51,840 INFO L93 Difference]: Finished difference Result 342 states and 532 transitions. [2025-03-17 01:22:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:22:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:22:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:22:51,843 INFO L225 Difference]: With dead ends: 342 [2025-03-17 01:22:51,843 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 01:22:51,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:22:51,843 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:22:51,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:22:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 01:22:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2025-03-17 01:22:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 125 states have (on average 1.384) internal successors, (173), 126 states have internal predecessors, (173), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 01:22:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 285 transitions. [2025-03-17 01:22:51,860 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 285 transitions. Word has length 126 [2025-03-17 01:22:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:22:51,861 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 285 transitions. [2025-03-17 01:22:51,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:22:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 285 transitions. [2025-03-17 01:22:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:22:51,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:22:51,862 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:22:51,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:22:51,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:22:51,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:22:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 34768104, now seen corresponding path program 1 times [2025-03-17 01:22:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:22:51,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155352937] [2025-03-17 01:22:51,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:22:51,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:22:51,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:22:51,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 01:22:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:22:52,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155352937] [2025-03-17 01:22:52,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155352937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:22:52,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934103759] [2025-03-17 01:22:52,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:52,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:22:52,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:22:52,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:22:52,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:22:52,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:22:52,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:22:52,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:52,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:52,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 01:22:52,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:22:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-17 01:22:52,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:22:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-17 01:22:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934103759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:22:52,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:22:52,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2025-03-17 01:22:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874152299] [2025-03-17 01:22:52,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:22:52,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 01:22:52,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:22:52,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 01:22:52,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:22:52,885 INFO L87 Difference]: Start difference. First operand 187 states and 285 transitions. Second operand has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (45), 4 states have call predecessors, (45), 4 states have call successors, (45) [2025-03-17 01:22:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:22:54,611 INFO L93 Difference]: Finished difference Result 775 states and 1096 transitions. [2025-03-17 01:22:54,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-17 01:22:54,612 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (45), 4 states have call predecessors, (45), 4 states have call successors, (45) Word has length 126 [2025-03-17 01:22:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:22:54,614 INFO L225 Difference]: With dead ends: 775 [2025-03-17 01:22:54,614 INFO L226 Difference]: Without dead ends: 627 [2025-03-17 01:22:54,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1468, Invalid=5174, Unknown=0, NotChecked=0, Total=6642 [2025-03-17 01:22:54,618 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 814 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:22:54,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 607 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:22:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-17 01:22:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 345. [2025-03-17 01:22:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 249 states have (on average 1.2891566265060241) internal successors, (321), 251 states have internal predecessors, (321), 76 states have call successors, (76), 19 states have call predecessors, (76), 19 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 01:22:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 473 transitions. [2025-03-17 01:22:54,653 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 473 transitions. Word has length 126 [2025-03-17 01:22:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:22:54,654 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 473 transitions. [2025-03-17 01:22:54,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (45), 4 states have call predecessors, (45), 4 states have call successors, (45) [2025-03-17 01:22:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 473 transitions. [2025-03-17 01:22:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:22:54,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:22:54,655 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:22:54,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:22:54,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 01:22:54,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:22:54,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:22:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1654291303, now seen corresponding path program 1 times [2025-03-17 01:22:54,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:22:54,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019594845] [2025-03-17 01:22:54,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:54,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:22:54,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:22:54,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:22:54,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:54,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:22:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140682044] [2025-03-17 01:22:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:22:54,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:22:54,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:22:54,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:22:54,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 01:22:54,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:22:55,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:22:55,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:22:55,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:22:55,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 01:22:55,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:22:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 01:22:55,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:04,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:04,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019594845] [2025-03-17 01:23:04,270 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:23:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140682044] [2025-03-17 01:23:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140682044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:04,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:23:04,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-17 01:23:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82684524] [2025-03-17 01:23:04,270 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:04,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:23:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:04,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:23:04,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=96, Unknown=2, NotChecked=0, Total=132 [2025-03-17 01:23:04,272 INFO L87 Difference]: Start difference. First operand 345 states and 473 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 01:23:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:05,354 INFO L93 Difference]: Finished difference Result 1000 states and 1368 transitions. [2025-03-17 01:23:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:23:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2025-03-17 01:23:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:05,358 INFO L225 Difference]: With dead ends: 1000 [2025-03-17 01:23:05,358 INFO L226 Difference]: Without dead ends: 718 [2025-03-17 01:23:05,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=109, Invalid=269, Unknown=2, NotChecked=0, Total=380 [2025-03-17 01:23:05,359 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 93 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:05,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 470 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:23:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-17 01:23:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 617. [2025-03-17 01:23:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 449 states have (on average 1.289532293986637) internal successors, (579), 453 states have internal predecessors, (579), 134 states have call successors, (134), 33 states have call predecessors, (134), 33 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-17 01:23:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 847 transitions. [2025-03-17 01:23:05,410 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 847 transitions. Word has length 126 [2025-03-17 01:23:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:05,410 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 847 transitions. [2025-03-17 01:23:05,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 01:23:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 847 transitions. [2025-03-17 01:23:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:05,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:05,412 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:05,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 01:23:05,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:05,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:05,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash -312957257, now seen corresponding path program 1 times [2025-03-17 01:23:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825519918] [2025-03-17 01:23:05,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:05,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:05,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:05,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:05,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:05,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825519918] [2025-03-17 01:23:05,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825519918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:05,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:05,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:23:05,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72419720] [2025-03-17 01:23:05,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:05,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:23:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:05,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:23:05,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:23:05,762 INFO L87 Difference]: Start difference. First operand 617 states and 847 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:05,929 INFO L93 Difference]: Finished difference Result 1003 states and 1370 transitions. [2025-03-17 01:23:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:23:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2025-03-17 01:23:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:05,933 INFO L225 Difference]: With dead ends: 1003 [2025-03-17 01:23:05,934 INFO L226 Difference]: Without dead ends: 725 [2025-03-17 01:23:05,935 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-03-17 01:23:05,936 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:05,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 171 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:23:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-17 01:23:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 638. [2025-03-17 01:23:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 467 states have (on average 1.284796573875803) internal successors, (600), 472 states have internal predecessors, (600), 136 states have call successors, (136), 34 states have call predecessors, (136), 34 states have return successors, (136), 131 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 01:23:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 872 transitions. [2025-03-17 01:23:05,991 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 872 transitions. Word has length 127 [2025-03-17 01:23:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:05,991 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 872 transitions. [2025-03-17 01:23:05,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 872 transitions. [2025-03-17 01:23:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:05,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:05,992 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:05,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:23:05,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:05,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2120411720, now seen corresponding path program 1 times [2025-03-17 01:23:05,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:05,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797018756] [2025-03-17 01:23:05,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:05,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:06,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:06,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:06,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:23:06,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201883495] [2025-03-17 01:23:06,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:06,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:06,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:06,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:23:06,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 01:23:06,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:06,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:06,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:06,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:23:06,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:23:06,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:06,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:06,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:06,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:23:06,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:23:06,224 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:23:06,224 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:23:06,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 01:23:06,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:06,429 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:06,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:23:06,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:23:06 BoogieIcfgContainer [2025-03-17 01:23:06,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:23:06,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:23:06,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:23:06,499 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:23:06,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:22:48" (3/4) ... [2025-03-17 01:23:06,501 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:23:06,501 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:23:06,502 INFO L158 Benchmark]: Toolchain (without parser) took 18320.07ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 106.9MB in the beginning and 181.7MB in the end (delta: -74.8MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2025-03-17 01:23:06,502 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:23:06,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.93ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 91.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:23:06,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.77ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 87.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:23:06,502 INFO L158 Benchmark]: Boogie Preprocessor took 36.78ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 82.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:23:06,502 INFO L158 Benchmark]: IcfgBuilder took 462.25ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 55.4MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:23:06,502 INFO L158 Benchmark]: TraceAbstraction took 17583.57ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 55.4MB in the beginning and 181.8MB in the end (delta: -126.5MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2025-03-17 01:23:06,503 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 310.4MB. Free memory was 181.8MB in the beginning and 181.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:23:06,503 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.13ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.93ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 91.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.77ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 87.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.78ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 82.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 462.25ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 55.4MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17583.57ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 55.4MB in the beginning and 181.8MB in the end (delta: -126.5MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 310.4MB. Free memory was 181.8MB in the beginning and 181.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] float var_1_26 = 500.65; [L38] float var_1_30 = 9.8; [L39] unsigned char var_1_31 = 4; [L40] unsigned short int var_1_34 = 1; [L41] unsigned long int var_1_35 = 10; [L42] unsigned char var_1_36 = 10; [L43] unsigned char var_1_38 = 16; [L44] unsigned char var_1_39 = 0; [L45] unsigned short int var_1_40 = 10; [L46] unsigned short int var_1_41 = 128; [L47] unsigned short int var_1_42 = 40597; [L48] signed short int last_1_var_1_1 = 16; [L49] unsigned char last_1_var_1_6 = 10; [L50] unsigned char last_1_var_1_8 = 1; [L51] signed short int last_1_var_1_13 = 200; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L171] last_1_var_1_1 = var_1_1 [L172] last_1_var_1_6 = var_1_6 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_13 = var_1_13 [L184] RET updateLastVariables() [L185] CALL updateVariables() [L141] var_1_5 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L142] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L143] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L143] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L144] var_1_7 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L145] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L146] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L146] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L150] var_1_12 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L151] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L152] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L154] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L155] var_1_16 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L156] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L157] var_1_20 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L158] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L159] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L160] var_1_38 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L161] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L162] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L163] var_1_39 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L164] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L165] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L166] var_1_42 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L167] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L168] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] signed long int stepLocal_6 = last_1_var_1_1; [L56] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L57] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L58] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L61] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L66] COND FALSE !((- var_1_15) < ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L69] COND TRUE \read(var_1_11) [L70] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L72] COND TRUE \read(var_1_11) [L73] var_1_36 = (var_1_7 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L77] COND FALSE !(var_1_7 <= (~ var_1_6)) [L82] var_1_41 = var_1_6 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L84] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L87] COND TRUE var_1_5 >= -2 [L88] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L90] COND TRUE ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_5)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_5))) <= var_1_13 [L91] var_1_31 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L93] COND TRUE (- var_1_6) != var_1_7 [L94] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L96] unsigned char stepLocal_4 = var_1_6; [L97] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L98] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L99] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L100] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L107] COND FALSE !(((var_1_7 + 25) % var_1_7) < 2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L110] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L111] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L114] COND FALSE !(var_1_7 < ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L117] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L118] COND TRUE \read(var_1_19) [L119] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L125] COND TRUE var_1_12 || var_1_19 [L126] var_1_21 = ((var_1_6 > -4) || var_1_11) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L128] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L129] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L130] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L137] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 124 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1339 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1338 mSDsluCounter, 2706 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1764 mSDsCounter, 370 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1749 IncrementalHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 370 mSolverCounterUnsat, 942 mSDtfsCounter, 1749 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 545 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=638occurred in iteration=9, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 626 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 1764 NumberOfCodeBlocks, 1764 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 4036 SizeOfPredicates, 6 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 7127/7344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 01:23:06,711 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-17 01:23:06,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:23:08,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:23:08,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:23:08,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:23:08,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:23:08,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:23:08,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:23:08,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:23:08,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:23:08,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:23:08,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:23:08,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:23:08,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:23:08,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:23:08,454 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:23:08,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:23:08,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:23:08,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:23:08,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:23:08,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:23:08,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:23:08,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:23:08,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:23:08,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:23:08,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:23:08,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:08,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:23:08,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:23:08,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:23:08,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:23:08,458 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:23:08,458 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:08,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:23:08,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:23:08,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:23:08,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:23:08,458 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 [2025-03-17 01:23:08,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:23:08,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:23:08,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:23:08,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:23:08,709 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:23:08,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-03-17 01:23:09,826 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb500cfd4/333c41c27c574a76a02ff49912d2cdd7/FLAG3768b0ba6 [2025-03-17 01:23:10,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:23:10,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-03-17 01:23:10,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb500cfd4/333c41c27c574a76a02ff49912d2cdd7/FLAG3768b0ba6 [2025-03-17 01:23:10,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb500cfd4/333c41c27c574a76a02ff49912d2cdd7 [2025-03-17 01:23:10,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:23:10,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:23:10,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:10,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:23:10,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:23:10,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60177a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10, skipping insertion in model container [2025-03-17 01:23:10,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:23:10,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2025-03-17 01:23:10,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:23:10,561 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:23:10,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2025-03-17 01:23:10,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:23:10,606 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:23:10,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10 WrapperNode [2025-03-17 01:23:10,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:10,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:23:10,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:23:10,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:23:10,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,652 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-03-17 01:23:10,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:23:10,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:23:10,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:23:10,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:23:10,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:23:10,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:23:10,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:23:10,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:23:10,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:23:10,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (1/1) ... [2025-03-17 01:23:10,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:10,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:10,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:23:10,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:23:10,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:23:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:23:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:23:10,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:23:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:23:10,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:23:10,816 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:23:10,818 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:23:11,228 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 01:23:11,228 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:23:11,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:23:11,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:23:11,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:11 BoogieIcfgContainer [2025-03-17 01:23:11,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:23:11,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:23:11,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:23:11,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:23:11,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:23:10" (1/3) ... [2025-03-17 01:23:11,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f36f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:23:11, skipping insertion in model container [2025-03-17 01:23:11,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:10" (2/3) ... [2025-03-17 01:23:11,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f36f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:23:11, skipping insertion in model container [2025-03-17 01:23:11,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:11" (3/3) ... [2025-03-17 01:23:11,245 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-03-17 01:23:11,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:23:11,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:23:11,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:23:11,298 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;@72871926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:23:11,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:23:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 01:23:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 01:23:11,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:11,307 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:11,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 758921721, now seen corresponding path program 1 times [2025-03-17 01:23:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140050469] [2025-03-17 01:23:11,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:11,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:11,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:11,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:11,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 01:23:11,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 01:23:11,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 01:23:11,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:11,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:11,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:23:11,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-17 01:23:11,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:11,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:11,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140050469] [2025-03-17 01:23:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140050469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:23:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548856313] [2025-03-17 01:23:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:11,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:23:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:23:11,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:23:11,640 INFO L87 Difference]: Start difference. First operand has 66 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 01:23:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:11,655 INFO L93 Difference]: Finished difference Result 128 states and 226 transitions. [2025-03-17 01:23:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:23:11,656 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2025-03-17 01:23:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:11,659 INFO L225 Difference]: With dead ends: 128 [2025-03-17 01:23:11,660 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 01:23:11,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:23:11,663 INFO L435 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:11,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:23:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 01:23:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 01:23:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 01:23:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2025-03-17 01:23:11,696 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 125 [2025-03-17 01:23:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:11,696 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2025-03-17 01:23:11,696 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 01:23:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2025-03-17 01:23:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 01:23:11,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:11,700 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:11,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 01:23:11,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:11,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:11,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash -945169477, now seen corresponding path program 1 times [2025-03-17 01:23:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523138715] [2025-03-17 01:23:11,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:11,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:11,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:11,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:11,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 01:23:11,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 01:23:12,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 01:23:12,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:12,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:12,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:23:12,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:12,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:12,356 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:12,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523138715] [2025-03-17 01:23:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523138715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:12,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:12,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:23:12,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231276606] [2025-03-17 01:23:12,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:12,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:23:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:12,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:23:12,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:23:12,360 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:12,601 INFO L93 Difference]: Finished difference Result 188 states and 296 transitions. [2025-03-17 01:23:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:23:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2025-03-17 01:23:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:12,609 INFO L225 Difference]: With dead ends: 188 [2025-03-17 01:23:12,609 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 01:23:12,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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-03-17 01:23:12,610 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 100 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:12,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 283 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:23:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 01:23:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2025-03-17 01:23:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 01:23:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2025-03-17 01:23:12,635 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 125 [2025-03-17 01:23:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:12,635 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2025-03-17 01:23:12,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2025-03-17 01:23:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:23:12,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:12,637 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:12,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 01:23:12,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:12,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash 494068937, now seen corresponding path program 1 times [2025-03-17 01:23:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941579563] [2025-03-17 01:23:12,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:12,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:12,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:12,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:12,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 01:23:12,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:13,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:13,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:13,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:13,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:23:13,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:13,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:13,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941579563] [2025-03-17 01:23:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941579563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:13,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:13,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:23:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650283793] [2025-03-17 01:23:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:23:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:13,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:23:13,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:23:13,526 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:14,079 INFO L93 Difference]: Finished difference Result 283 states and 449 transitions. [2025-03-17 01:23:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:23:14,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:23:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:14,085 INFO L225 Difference]: With dead ends: 283 [2025-03-17 01:23:14,085 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 01:23:14,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:23:14,086 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 145 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:14,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 434 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:23:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 01:23:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 157. [2025-03-17 01:23:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:23:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 245 transitions. [2025-03-17 01:23:14,109 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 245 transitions. Word has length 126 [2025-03-17 01:23:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:14,110 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 245 transitions. [2025-03-17 01:23:14,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 245 transitions. [2025-03-17 01:23:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:23:14,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:14,111 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:14,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 01:23:14,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:14,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1738833418, now seen corresponding path program 1 times [2025-03-17 01:23:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:14,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308898591] [2025-03-17 01:23:14,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:14,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:14,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:14,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:14,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 01:23:14,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:14,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:14,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:14,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:14,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:23:14,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 01:23:14,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:14,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:14,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308898591] [2025-03-17 01:23:14,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308898591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:14,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [737394135] [2025-03-17 01:23:14,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:14,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:14,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:23:14,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:23:14,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-17 01:23:14,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:15,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:15,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:15,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:15,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 01:23:15,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:15,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [737394135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:15,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:23:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-17 01:23:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142258804] [2025-03-17 01:23:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:15,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:23:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:15,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:23:15,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:23:15,303 INFO L87 Difference]: Start difference. First operand 157 states and 245 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:15,554 INFO L93 Difference]: Finished difference Result 248 states and 385 transitions. [2025-03-17 01:23:15,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:23:15,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:23:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:15,558 INFO L225 Difference]: With dead ends: 248 [2025-03-17 01:23:15,558 INFO L226 Difference]: Without dead ends: 186 [2025-03-17 01:23:15,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:23:15,559 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 39 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:15,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 157 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:23:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-17 01:23:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2025-03-17 01:23:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 122 states have (on average 1.4098360655737705) internal successors, (172), 123 states have internal predecessors, (172), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 01:23:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 284 transitions. [2025-03-17 01:23:15,589 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 284 transitions. Word has length 126 [2025-03-17 01:23:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:15,589 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 284 transitions. [2025-03-17 01:23:15,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 284 transitions. [2025-03-17 01:23:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:23:15,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:15,591 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:15,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-17 01:23:15,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-17 01:23:15,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:15,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:15,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash 231281609, now seen corresponding path program 1 times [2025-03-17 01:23:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890664867] [2025-03-17 01:23:15,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:15,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:15,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 01:23:16,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:16,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:16,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:16,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:16,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 01:23:16,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:16,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:16,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:16,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890664867] [2025-03-17 01:23:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890664867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:16,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:23:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568560754] [2025-03-17 01:23:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:16,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:23:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:16,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:23:16,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:23:16,202 INFO L87 Difference]: Start difference. First operand 183 states and 284 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:16,302 INFO L93 Difference]: Finished difference Result 331 states and 516 transitions. [2025-03-17 01:23:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:23:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:23:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:16,306 INFO L225 Difference]: With dead ends: 331 [2025-03-17 01:23:16,306 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 01:23:16,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:23:16,307 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:16,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:23:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 01:23:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-17 01:23:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 123 states have internal predecessors, (169), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 01:23:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 281 transitions. [2025-03-17 01:23:16,332 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 281 transitions. Word has length 126 [2025-03-17 01:23:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:16,332 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 281 transitions. [2025-03-17 01:23:16,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 281 transitions. [2025-03-17 01:23:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:23:16,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:16,334 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:16,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 01:23:16,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:16,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:16,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 34768104, now seen corresponding path program 1 times [2025-03-17 01:23:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025005851] [2025-03-17 01:23:16,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:16,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:16,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:16,538 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:16,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 01:23:16,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:16,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:16,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:16,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:16,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 01:23:16,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-17 01:23:16,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-17 01:23:17,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025005851] [2025-03-17 01:23:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025005851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:23:17,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:23:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-17 01:23:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077431436] [2025-03-17 01:23:17,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:17,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:23:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:17,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:23:17,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:23:17,207 INFO L87 Difference]: Start difference. First operand 183 states and 281 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-17 01:23:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:17,929 INFO L93 Difference]: Finished difference Result 495 states and 722 transitions. [2025-03-17 01:23:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 01:23:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 126 [2025-03-17 01:23:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:17,932 INFO L225 Difference]: With dead ends: 495 [2025-03-17 01:23:17,933 INFO L226 Difference]: Without dead ends: 347 [2025-03-17 01:23:17,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 01:23:17,935 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 257 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:17,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 436 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:23:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-17 01:23:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 317. [2025-03-17 01:23:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 226 states have (on average 1.3539823008849559) internal successors, (306), 228 states have internal predecessors, (306), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 01:23:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 458 transitions. [2025-03-17 01:23:17,968 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 458 transitions. Word has length 126 [2025-03-17 01:23:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:17,969 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 458 transitions. [2025-03-17 01:23:17,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-17 01:23:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 458 transitions. [2025-03-17 01:23:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:23:17,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:17,970 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:17,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 01:23:18,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:18,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:18,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -962304249, now seen corresponding path program 1 times [2025-03-17 01:23:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855830635] [2025-03-17 01:23:18,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:18,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:18,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:18,175 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:18,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 01:23:18,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:18,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:18,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:18,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:18,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:23:18,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 01:23:18,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:19,151 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855830635] [2025-03-17 01:23:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855830635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2012709766] [2025-03-17 01:23:19,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:19,151 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:19,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:23:19,154 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:23:19,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-17 01:23:19,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:19,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:19,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:19,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:19,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 01:23:19,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:20,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2012709766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:20,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:23:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 01:23:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301234531] [2025-03-17 01:23:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:23:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:20,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:23:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:23:20,002 INFO L87 Difference]: Start difference. First operand 317 states and 458 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:21,610 INFO L93 Difference]: Finished difference Result 926 states and 1334 transitions. [2025-03-17 01:23:21,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 01:23:21,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:23:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:21,613 INFO L225 Difference]: With dead ends: 926 [2025-03-17 01:23:21,613 INFO L226 Difference]: Without dead ends: 660 [2025-03-17 01:23:21,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:23:21,614 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 155 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:21,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 433 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 01:23:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-17 01:23:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 577. [2025-03-17 01:23:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 417 states have (on average 1.3453237410071943) internal successors, (561), 421 states have internal predecessors, (561), 134 states have call successors, (134), 25 states have call predecessors, (134), 25 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-17 01:23:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 829 transitions. [2025-03-17 01:23:21,657 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 829 transitions. Word has length 126 [2025-03-17 01:23:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:21,658 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 829 transitions. [2025-03-17 01:23:21,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 829 transitions. [2025-03-17 01:23:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 01:23:21,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:21,659 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:21,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 01:23:21,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-17 01:23:22,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:22,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:22,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash 391005448, now seen corresponding path program 1 times [2025-03-17 01:23:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:22,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189533421] [2025-03-17 01:23:22,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:22,063 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:22,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 01:23:22,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:22,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:22,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:22,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:22,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:23:22,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 01:23:22,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:22,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189533421] [2025-03-17 01:23:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189533421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [128272029] [2025-03-17 01:23:22,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:22,759 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:22,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:23:22,761 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:23:22,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-17 01:23:22,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 01:23:23,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 01:23:23,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:23,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:23,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 01:23:23,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:23,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [128272029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:23,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:23:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-17 01:23:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115612315] [2025-03-17 01:23:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:23,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:23:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:23,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:23:23,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:23:23,656 INFO L87 Difference]: Start difference. First operand 577 states and 829 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:24,760 INFO L93 Difference]: Finished difference Result 1208 states and 1738 transitions. [2025-03-17 01:23:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:23:24,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-03-17 01:23:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:24,764 INFO L225 Difference]: With dead ends: 1208 [2025-03-17 01:23:24,764 INFO L226 Difference]: Without dead ends: 760 [2025-03-17 01:23:24,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:23:24,766 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 88 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:24,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 382 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:23:24,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-17 01:23:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 712. [2025-03-17 01:23:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 510 states have (on average 1.3352941176470587) internal successors, (681), 514 states have internal predecessors, (681), 170 states have call successors, (170), 31 states have call predecessors, (170), 31 states have return successors, (170), 166 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-17 01:23:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1021 transitions. [2025-03-17 01:23:24,805 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1021 transitions. Word has length 126 [2025-03-17 01:23:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:24,806 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1021 transitions. [2025-03-17 01:23:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1021 transitions. [2025-03-17 01:23:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:24,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:24,807 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:24,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 01:23:25,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2025-03-17 01:23:25,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:25,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:25,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash -442039976, now seen corresponding path program 1 times [2025-03-17 01:23:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014858138] [2025-03-17 01:23:25,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:25,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:25,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:25,211 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:25,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-17 01:23:25,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:25,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:25,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:25,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:25,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:23:25,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 01:23:25,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 01:23:25,716 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014858138] [2025-03-17 01:23:25,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014858138] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:25,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:23:25,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 01:23:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309429192] [2025-03-17 01:23:25,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:25,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:23:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:25,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:23:25,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:23:25,718 INFO L87 Difference]: Start difference. First operand 712 states and 1021 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:26,451 INFO L93 Difference]: Finished difference Result 1467 states and 2052 transitions. [2025-03-17 01:23:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:23:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2025-03-17 01:23:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:26,462 INFO L225 Difference]: With dead ends: 1467 [2025-03-17 01:23:26,462 INFO L226 Difference]: Without dead ends: 1209 [2025-03-17 01:23:26,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:23:26,465 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:26,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 192 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:23:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-03-17 01:23:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 812. [2025-03-17 01:23:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 597 states have (on average 1.3283082077051926) internal successors, (793), 605 states have internal predecessors, (793), 178 states have call successors, (178), 36 states have call predecessors, (178), 36 states have return successors, (178), 170 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-17 01:23:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1149 transitions. [2025-03-17 01:23:26,540 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1149 transitions. Word has length 127 [2025-03-17 01:23:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:26,541 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1149 transitions. [2025-03-17 01:23:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 01:23:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1149 transitions. [2025-03-17 01:23:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:26,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:26,542 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:26,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-17 01:23:26,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:26,743 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:26,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2045472857, now seen corresponding path program 1 times [2025-03-17 01:23:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512183219] [2025-03-17 01:23:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:26,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:26,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:26,745 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:26,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-17 01:23:26,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:26,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:26,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:26,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:26,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:23:26,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 01:23:27,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 01:23:28,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:23:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512183219] [2025-03-17 01:23:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512183219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:23:28,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:23:28,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 01:23:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186160586] [2025-03-17 01:23:28,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:23:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:23:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:23:28,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:23:28,018 INFO L87 Difference]: Start difference. First operand 812 states and 1149 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-17 01:23:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:28,335 INFO L93 Difference]: Finished difference Result 1538 states and 2119 transitions. [2025-03-17 01:23:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:23:28,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 127 [2025-03-17 01:23:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:28,339 INFO L225 Difference]: With dead ends: 1538 [2025-03-17 01:23:28,339 INFO L226 Difference]: Without dead ends: 790 [2025-03-17 01:23:28,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:23:28,341 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:28,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 148 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:23:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-17 01:23:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 702. [2025-03-17 01:23:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 494 states have (on average 1.2469635627530364) internal successors, (616), 494 states have internal predecessors, (616), 162 states have call successors, (162), 45 states have call predecessors, (162), 45 states have return successors, (162), 162 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-17 01:23:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 940 transitions. [2025-03-17 01:23:28,400 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 940 transitions. Word has length 127 [2025-03-17 01:23:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:28,401 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 940 transitions. [2025-03-17 01:23:28,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-17 01:23:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 940 transitions. [2025-03-17 01:23:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:23:28,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:28,403 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:28,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-17 01:23:28,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:28,604 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:28,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2120411720, now seen corresponding path program 1 times [2025-03-17 01:23:28,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:23:28,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139276548] [2025-03-17 01:23:28,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:28,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:23:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:23:28,607 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:23:28,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-17 01:23:28,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:23:28,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:23:28,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:28,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:28,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 01:23:28,986 INFO L279 TraceCheckSpWp]: Computing forward predicates...