./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.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_fillercodesize_ps-cn-100_file-79.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 68466dc8851e15d5c55e16cb6abd8cdccbbd4db381e8ec074cd8097ac9916cb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:47:39,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:47:39,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:47:39,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:47:39,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:47:39,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:47:39,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:47:39,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:47:39,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:47:39,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:47:39,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:47:39,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:47:39,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:47:39,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:47:39,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:47:39,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:47:39,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:47:39,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:47:39,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:47:39,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:47:39,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:47:39,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:47:39,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:47:39,558 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 -> 68466dc8851e15d5c55e16cb6abd8cdccbbd4db381e8ec074cd8097ac9916cb7 [2025-03-16 23:47:39,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:47:39,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:47:39,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:47:39,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:47:39,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:47:39,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-03-16 23:47:41,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d45a897/9f722bd663a448dfae5cb9b462533390/FLAG5e18771e6 [2025-03-16 23:47:41,486 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:47:41,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-03-16 23:47:41,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d45a897/9f722bd663a448dfae5cb9b462533390/FLAG5e18771e6 [2025-03-16 23:47:41,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d45a897/9f722bd663a448dfae5cb9b462533390 [2025-03-16 23:47:41,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:47:41,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:47:41,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:47:41,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:47:41,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:47:41,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240b7983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41, skipping insertion in model container [2025-03-16 23:47:41,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:47:41,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i[916,929] [2025-03-16 23:47:41,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:47:41,768 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:47:41,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i[916,929] [2025-03-16 23:47:41,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:47:41,857 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:47:41,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41 WrapperNode [2025-03-16 23:47:41,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:47:41,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:47:41,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:47:41,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:47:41,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,934 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2025-03-16 23:47:41,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:47:41,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:47:41,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:47:41,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:47:41,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,969 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-16 23:47:41,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:41,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:42,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:47:42,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:47:42,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:47:42,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:47:42,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (1/1) ... [2025-03-16 23:47:42,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:47:42,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:47:42,039 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-16 23:47:42,048 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-16 23:47:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:47:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:47:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:47:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:47:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:47:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:47:42,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:47:42,177 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:47:42,856 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:47:42,856 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:47:42,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:47:42,876 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:47:42,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:47:42 BoogieIcfgContainer [2025-03-16 23:47:42,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:47:42,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:47:42,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:47:42,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:47:42,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:47:41" (1/3) ... [2025-03-16 23:47:42,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16457150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:47:42, skipping insertion in model container [2025-03-16 23:47:42,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:47:41" (2/3) ... [2025-03-16 23:47:42,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16457150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:47:42, skipping insertion in model container [2025-03-16 23:47:42,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:47:42" (3/3) ... [2025-03-16 23:47:42,886 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-03-16 23:47:42,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:47:42,902 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-79.i that has 2 procedures, 171 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:47:42,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:47:42,963 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;@6c9d6b17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:47:42,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:47:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 95 states have (on average 1.4) internal successors, (133), 96 states have internal predecessors, (133), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-16 23:47:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-16 23:47:42,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:47:42,987 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:47:42,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:47:42,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:47:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash -359458760, now seen corresponding path program 1 times [2025-03-16 23:47:42,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:47:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20029542] [2025-03-16 23:47:43,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:47:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:47:43,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-16 23:47:43,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-16 23:47:43,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:47:43,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:47:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-16 23:47:43,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:47:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20029542] [2025-03-16 23:47:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20029542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:47:43,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003616543] [2025-03-16 23:47:43,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:47:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:47:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:47:43,454 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-16 23:47:43,456 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-16 23:47:43,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-16 23:47:43,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-16 23:47:43,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:47:43,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:47:43,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:47:43,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:47:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-16 23:47:43,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:47:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003616543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:47:43,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:47:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:47:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026534388] [2025-03-16 23:47:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:47:43,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:47:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:47:43,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:47:43,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:47:43,858 INFO L87 Difference]: Start difference. First operand has 171 states, 95 states have (on average 1.4) internal successors, (133), 96 states have internal predecessors, (133), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-16 23:47:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:47:43,903 INFO L93 Difference]: Finished difference Result 339 states and 629 transitions. [2025-03-16 23:47:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:47:43,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 437 [2025-03-16 23:47:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:47:43,911 INFO L225 Difference]: With dead ends: 339 [2025-03-16 23:47:43,914 INFO L226 Difference]: Without dead ends: 169 [2025-03-16 23:47:43,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 438 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-16 23:47:43,924 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:47:43,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:47:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-16 23:47:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-16 23:47:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-16 23:47:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2025-03-16 23:47:43,996 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 437 [2025-03-16 23:47:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:47:43,996 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2025-03-16 23:47:43,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-16 23:47:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2025-03-16 23:47:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-16 23:47:44,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:47:44,008 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:47:44,017 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-16 23:47:44,209 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-16 23:47:44,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:47:44,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:47:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash -699424629, now seen corresponding path program 1 times [2025-03-16 23:47:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:47:44,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141140225] [2025-03-16 23:47:44,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:47:44,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:47:44,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-16 23:47:44,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-16 23:47:44,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:47:44,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:47:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-16 23:47:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:47:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141140225] [2025-03-16 23:47:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141140225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:47:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:47:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:47:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534430326] [2025-03-16 23:47:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:47:44,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:47:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:47:45,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:47:45,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:47:45,002 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:47:45,111 INFO L93 Difference]: Finished difference Result 505 states and 820 transitions. [2025-03-16 23:47:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:47:45,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 437 [2025-03-16 23:47:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:47:45,118 INFO L225 Difference]: With dead ends: 505 [2025-03-16 23:47:45,120 INFO L226 Difference]: Without dead ends: 337 [2025-03-16 23:47:45,121 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-16 23:47:45,123 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 131 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:47:45,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 535 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:47:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-16 23:47:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2025-03-16 23:47:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 186 states have (on average 1.3548387096774193) internal successors, (252), 186 states have internal predecessors, (252), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-16 23:47:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 544 transitions. [2025-03-16 23:47:45,212 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 544 transitions. Word has length 437 [2025-03-16 23:47:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:47:45,215 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 544 transitions. [2025-03-16 23:47:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 544 transitions. [2025-03-16 23:47:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-16 23:47:45,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:47:45,222 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:47:45,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:47:45,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:47:45,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:47:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -734364806, now seen corresponding path program 1 times [2025-03-16 23:47:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:47:45,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903064926] [2025-03-16 23:47:45,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:47:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:47:45,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-16 23:47:45,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-16 23:47:45,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:47:45,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:47:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-16 23:47:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:47:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903064926] [2025-03-16 23:47:46,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903064926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:47:46,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:47:46,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:47:46,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899661107] [2025-03-16 23:47:46,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:47:46,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:47:46,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:47:46,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:47:46,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:47:46,004 INFO L87 Difference]: Start difference. First operand 335 states and 544 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:47:46,472 INFO L93 Difference]: Finished difference Result 684 states and 1107 transitions. [2025-03-16 23:47:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:47:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 438 [2025-03-16 23:47:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:47:46,479 INFO L225 Difference]: With dead ends: 684 [2025-03-16 23:47:46,479 INFO L226 Difference]: Without dead ends: 350 [2025-03-16 23:47:46,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:47:46,481 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 197 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:47:46,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 919 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:47:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-16 23:47:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 335. [2025-03-16 23:47:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 186 states have (on average 1.3494623655913978) internal successors, (251), 186 states have internal predecessors, (251), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-16 23:47:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 543 transitions. [2025-03-16 23:47:46,540 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 543 transitions. Word has length 438 [2025-03-16 23:47:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:47:46,543 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 543 transitions. [2025-03-16 23:47:46,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 543 transitions. [2025-03-16 23:47:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-16 23:47:46,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:47:46,550 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:47:46,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:47:46,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:47:46,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:47:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1576903511, now seen corresponding path program 1 times [2025-03-16 23:47:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:47:46,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558507227] [2025-03-16 23:47:46,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:47:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:47:46,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-16 23:47:46,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-16 23:47:46,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:47:46,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:47:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-16 23:47:46,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:47:46,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558507227] [2025-03-16 23:47:46,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558507227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:47:46,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:47:46,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:47:46,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120877015] [2025-03-16 23:47:46,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:47:46,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:47:46,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:47:46,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:47:46,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:47:46,845 INFO L87 Difference]: Start difference. First operand 335 states and 543 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:47:46,892 INFO L93 Difference]: Finished difference Result 679 states and 1103 transitions. [2025-03-16 23:47:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:47:46,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 439 [2025-03-16 23:47:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:47:46,898 INFO L225 Difference]: With dead ends: 679 [2025-03-16 23:47:46,899 INFO L226 Difference]: Without dead ends: 345 [2025-03-16 23:47:46,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:47:46,902 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 18 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:47:46,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 547 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:47:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-16 23:47:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 335. [2025-03-16 23:47:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 186 states have (on average 1.3387096774193548) internal successors, (249), 186 states have internal predecessors, (249), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-16 23:47:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 541 transitions. [2025-03-16 23:47:46,966 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 541 transitions. Word has length 439 [2025-03-16 23:47:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:47:46,970 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 541 transitions. [2025-03-16 23:47:46,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 541 transitions. [2025-03-16 23:47:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-16 23:47:46,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:47:46,977 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:47:46,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:47:46,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:47:46,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:47:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash 921112426, now seen corresponding path program 1 times [2025-03-16 23:47:46,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:47:46,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572147532] [2025-03-16 23:47:46,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:47:46,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:47:47,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-16 23:47:47,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-16 23:47:47,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:47:47,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:47:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-16 23:47:47,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:47:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572147532] [2025-03-16 23:47:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572147532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:47:47,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:47:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:47:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272708930] [2025-03-16 23:47:47,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:47:47,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:47:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:47:47,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:47:47,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:47:47,505 INFO L87 Difference]: Start difference. First operand 335 states and 541 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:47:47,571 INFO L93 Difference]: Finished difference Result 684 states and 1098 transitions. [2025-03-16 23:47:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:47:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 439 [2025-03-16 23:47:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:47:47,578 INFO L225 Difference]: With dead ends: 684 [2025-03-16 23:47:47,578 INFO L226 Difference]: Without dead ends: 350 [2025-03-16 23:47:47,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 23:47:47,580 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 30 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:47:47,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 519 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:47:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-16 23:47:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2025-03-16 23:47:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 194 states have (on average 1.3144329896907216) internal successors, (255), 195 states have internal predecessors, (255), 150 states have call successors, (150), 4 states have call predecessors, (150), 4 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-16 23:47:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 555 transitions. [2025-03-16 23:47:47,667 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 555 transitions. Word has length 439 [2025-03-16 23:47:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:47:47,668 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 555 transitions. [2025-03-16 23:47:47,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 555 transitions. [2025-03-16 23:47:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-16 23:47:47,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:47:47,677 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:47:47,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:47:47,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:47:47,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:47:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash -561798052, now seen corresponding path program 1 times [2025-03-16 23:47:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:47:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003337396] [2025-03-16 23:47:47,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:47:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:47:47,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-16 23:47:47,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-16 23:47:47,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:47:47,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:47:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-16 23:47:48,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:47:48,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003337396] [2025-03-16 23:47:48,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003337396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:47:48,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:47:48,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:47:48,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774186590] [2025-03-16 23:47:48,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:47:48,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:47:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:47:48,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:47:48,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:47:48,329 INFO L87 Difference]: Start difference. First operand 349 states and 555 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:47:52,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 23:47:56,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 23:48:00,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 23:48:04,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 23:48:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:48:04,900 INFO L93 Difference]: Finished difference Result 1073 states and 1697 transitions. [2025-03-16 23:48:04,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:48:04,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 440 [2025-03-16 23:48:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:48:04,911 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 23:48:04,911 INFO L226 Difference]: Without dead ends: 731 [2025-03-16 23:48:04,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:48:04,914 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 244 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 57 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:48:04,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1596 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 184 Invalid, 4 Unknown, 0 Unchecked, 16.4s Time] [2025-03-16 23:48:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-03-16 23:48:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 553. [2025-03-16 23:48:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 340 states have (on average 1.3764705882352941) internal successors, (468), 343 states have internal predecessors, (468), 204 states have call successors, (204), 8 states have call predecessors, (204), 8 states have return successors, (204), 201 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-16 23:48:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 876 transitions. [2025-03-16 23:48:04,995 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 876 transitions. Word has length 440 [2025-03-16 23:48:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:48:04,997 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 876 transitions. [2025-03-16 23:48:04,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:48:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 876 transitions. [2025-03-16 23:48:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-16 23:48:05,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:48:05,000 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:48:05,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:48:05,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:48:05,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:48:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash 131303645, now seen corresponding path program 1 times [2025-03-16 23:48:05,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:48:05,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310738660] [2025-03-16 23:48:05,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:05,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:48:05,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-16 23:48:05,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-16 23:48:05,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:05,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-16 23:48:05,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:48:05,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310738660] [2025-03-16 23:48:05,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310738660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:48:05,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:48:05,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:48:05,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084025363] [2025-03-16 23:48:05,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:48:05,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:48:05,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:48:05,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:48:05,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:48:05,246 INFO L87 Difference]: Start difference. First operand 553 states and 876 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:48:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:48:05,341 INFO L93 Difference]: Finished difference Result 1441 states and 2285 transitions. [2025-03-16 23:48:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:48:05,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 440 [2025-03-16 23:48:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:48:05,349 INFO L225 Difference]: With dead ends: 1441 [2025-03-16 23:48:05,350 INFO L226 Difference]: Without dead ends: 895 [2025-03-16 23:48:05,352 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-16 23:48:05,353 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 148 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:48:05,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 591 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:48:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-16 23:48:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 893. [2025-03-16 23:48:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 530 states have (on average 1.349056603773585) internal successors, (715), 533 states have internal predecessors, (715), 350 states have call successors, (350), 12 states have call predecessors, (350), 12 states have return successors, (350), 347 states have call predecessors, (350), 350 states have call successors, (350) [2025-03-16 23:48:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1415 transitions. [2025-03-16 23:48:05,475 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1415 transitions. Word has length 440 [2025-03-16 23:48:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:48:05,476 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1415 transitions. [2025-03-16 23:48:05,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-16 23:48:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1415 transitions. [2025-03-16 23:48:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-16 23:48:05,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:48:05,479 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:48:05,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:48:05,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:48:05,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:48:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash 352923548, now seen corresponding path program 1 times [2025-03-16 23:48:05,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:48:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226074629] [2025-03-16 23:48:05,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:48:05,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 23:48:05,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 23:48:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 42 proven. 174 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-16 23:48:06,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:48:06,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226074629] [2025-03-16 23:48:06,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226074629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:48:06,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249333335] [2025-03-16 23:48:06,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:06,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:48:06,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:48:06,039 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-16 23:48:06,040 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-16 23:48:06,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 23:48:06,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 23:48:06,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:06,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:06,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 23:48:06,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:48:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 3348 proven. 174 refuted. 0 times theorem prover too weak. 6990 trivial. 0 not checked. [2025-03-16 23:48:07,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:48:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 42 proven. 174 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-16 23:48:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249333335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:48:08,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:48:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-03-16 23:48:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266773708] [2025-03-16 23:48:08,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:48:08,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 23:48:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:48:08,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 23:48:08,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:48:08,820 INFO L87 Difference]: Start difference. First operand 893 states and 1415 transitions. Second operand has 17 states, 17 states have (on average 13.058823529411764) internal successors, (222), 17 states have internal predecessors, (222), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) [2025-03-16 23:48:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:48:09,546 INFO L93 Difference]: Finished difference Result 1397 states and 2176 transitions. [2025-03-16 23:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:48:09,547 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.058823529411764) internal successors, (222), 17 states have internal predecessors, (222), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) Word has length 441 [2025-03-16 23:48:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:48:09,557 INFO L225 Difference]: With dead ends: 1397 [2025-03-16 23:48:09,557 INFO L226 Difference]: Without dead ends: 953 [2025-03-16 23:48:09,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 872 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:48:09,560 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 369 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:48:09,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 622 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:48:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-16 23:48:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 637. [2025-03-16 23:48:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 374 states have (on average 1.3074866310160427) internal successors, (489), 376 states have internal predecessors, (489), 250 states have call successors, (250), 12 states have call predecessors, (250), 12 states have return successors, (250), 248 states have call predecessors, (250), 250 states have call successors, (250) [2025-03-16 23:48:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 989 transitions. [2025-03-16 23:48:09,652 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 989 transitions. Word has length 441 [2025-03-16 23:48:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:48:09,653 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 989 transitions. [2025-03-16 23:48:09,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.058823529411764) internal successors, (222), 17 states have internal predecessors, (222), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) [2025-03-16 23:48:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 989 transitions. [2025-03-16 23:48:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-16 23:48:09,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:48:09,657 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:48:09,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:48:09,857 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,SelfDestructingSolverStorable7 [2025-03-16 23:48:09,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:48:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:48:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2067479430, now seen corresponding path program 1 times [2025-03-16 23:48:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:48:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377745168] [2025-03-16 23:48:09,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:48:09,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 23:48:10,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 23:48:10,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:10,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 132 proven. 84 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-16 23:48:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:48:10,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377745168] [2025-03-16 23:48:10,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377745168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:48:10,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950236628] [2025-03-16 23:48:10,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:10,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:48:10,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:48:10,241 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-16 23:48:10,243 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-16 23:48:10,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 23:48:10,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 23:48:10,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:10,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:10,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:48:10,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:48:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4678 proven. 69 refuted. 0 times theorem prover too weak. 5765 trivial. 0 not checked. [2025-03-16 23:48:10,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:48:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 147 proven. 69 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-16 23:48:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950236628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:48:11,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:48:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-16 23:48:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25429033] [2025-03-16 23:48:11,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:48:11,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:48:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:48:11,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:48:11,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:48:11,070 INFO L87 Difference]: Start difference. First operand 637 states and 989 transitions. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) [2025-03-16 23:48:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:48:11,552 INFO L93 Difference]: Finished difference Result 1317 states and 2007 transitions. [2025-03-16 23:48:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:48:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) Word has length 441 [2025-03-16 23:48:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:48:11,559 INFO L225 Difference]: With dead ends: 1317 [2025-03-16 23:48:11,559 INFO L226 Difference]: Without dead ends: 687 [2025-03-16 23:48:11,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-03-16 23:48:11,563 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 193 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:48:11,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 385 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:48:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-16 23:48:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 657. [2025-03-16 23:48:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 388 states have (on average 1.2551546391752577) internal successors, (487), 390 states have internal predecessors, (487), 250 states have call successors, (250), 18 states have call predecessors, (250), 18 states have return successors, (250), 248 states have call predecessors, (250), 250 states have call successors, (250) [2025-03-16 23:48:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 987 transitions. [2025-03-16 23:48:11,631 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 987 transitions. Word has length 441 [2025-03-16 23:48:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:48:11,632 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 987 transitions. [2025-03-16 23:48:11,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) [2025-03-16 23:48:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 987 transitions. [2025-03-16 23:48:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-16 23:48:11,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:48:11,634 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:48:11,642 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-16 23:48:11,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:48:11,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:48:11,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:48:11,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1280539839, now seen corresponding path program 1 times [2025-03-16 23:48:11,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:48:11,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25630046] [2025-03-16 23:48:11,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:48:11,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-16 23:48:11,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-16 23:48:11,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:11,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 147 proven. 69 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-16 23:48:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:48:13,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25630046] [2025-03-16 23:48:13,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25630046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:48:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778097417] [2025-03-16 23:48:13,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:13,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:48:13,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:48:13,154 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-16 23:48:13,155 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-16 23:48:13,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-16 23:48:13,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-16 23:48:13,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:13,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:13,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 23:48:13,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:48:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 7431 proven. 249 refuted. 0 times theorem prover too weak. 2832 trivial. 0 not checked. [2025-03-16 23:48:15,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:48:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 381 proven. 258 refuted. 0 times theorem prover too weak. 9873 trivial. 0 not checked. [2025-03-16 23:48:17,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778097417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:48:17,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:48:17,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 40 [2025-03-16 23:48:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116285170] [2025-03-16 23:48:17,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:48:17,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 23:48:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:48:17,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 23:48:17,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 23:48:17,538 INFO L87 Difference]: Start difference. First operand 657 states and 987 transitions. Second operand has 40 states, 40 states have (on average 4.975) internal successors, (199), 40 states have internal predecessors, (199), 12 states have call successors, (165), 5 states have call predecessors, (165), 11 states have return successors, (165), 12 states have call predecessors, (165), 12 states have call successors, (165) [2025-03-16 23:48:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:48:30,347 INFO L93 Difference]: Finished difference Result 4861 states and 6883 transitions. [2025-03-16 23:48:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2025-03-16 23:48:30,348 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.975) internal successors, (199), 40 states have internal predecessors, (199), 12 states have call successors, (165), 5 states have call predecessors, (165), 11 states have return successors, (165), 12 states have call predecessors, (165), 12 states have call successors, (165) Word has length 444 [2025-03-16 23:48:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:48:30,366 INFO L225 Difference]: With dead ends: 4861 [2025-03-16 23:48:30,366 INFO L226 Difference]: Without dead ends: 4211 [2025-03-16 23:48:30,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 881 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8102 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=5366, Invalid=18196, Unknown=0, NotChecked=0, Total=23562 [2025-03-16 23:48:30,373 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1888 mSDsluCounter, 2757 mSDsCounter, 0 mSdLazyCounter, 5586 mSolverCounterSat, 2154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 7740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2154 IncrementalHoareTripleChecker+Valid, 5586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:48:30,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 3076 Invalid, 7740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2154 Valid, 5586 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-16 23:48:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2025-03-16 23:48:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 1221. [2025-03-16 23:48:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 747 states have (on average 1.2409638554216869) internal successors, (927), 752 states have internal predecessors, (927), 424 states have call successors, (424), 49 states have call predecessors, (424), 49 states have return successors, (424), 419 states have call predecessors, (424), 424 states have call successors, (424) [2025-03-16 23:48:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1775 transitions. [2025-03-16 23:48:30,602 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1775 transitions. Word has length 444 [2025-03-16 23:48:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:48:30,603 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1775 transitions. [2025-03-16 23:48:30,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.975) internal successors, (199), 40 states have internal predecessors, (199), 12 states have call successors, (165), 5 states have call predecessors, (165), 11 states have return successors, (165), 12 states have call predecessors, (165), 12 states have call successors, (165) [2025-03-16 23:48:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1775 transitions. [2025-03-16 23:48:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-16 23:48:30,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:48:30,606 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:48:30,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 23:48:30,806 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-16 23:48:30,806 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:48:30,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:48:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash -35775358, now seen corresponding path program 1 times [2025-03-16 23:48:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:48:30,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947244088] [2025-03-16 23:48:30,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:30,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:48:30,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-16 23:48:30,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-16 23:48:30,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:30,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 339 proven. 291 refuted. 0 times theorem prover too weak. 9882 trivial. 0 not checked. [2025-03-16 23:48:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:48:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947244088] [2025-03-16 23:48:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947244088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:48:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481491680] [2025-03-16 23:48:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:48:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:48:31,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:48:31,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 23:48:32,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-16 23:48:32,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-16 23:48:32,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:32,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:32,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-16 23:48:32,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:48:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 7448 proven. 504 refuted. 0 times theorem prover too weak. 2560 trivial. 0 not checked. [2025-03-16 23:48:35,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:48:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 381 proven. 258 refuted. 0 times theorem prover too weak. 9873 trivial. 0 not checked. [2025-03-16 23:48:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481491680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:48:42,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:48:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27, 20] total 56 [2025-03-16 23:48:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202802641] [2025-03-16 23:48:42,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:48:42,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-16 23:48:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:48:42,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-16 23:48:42,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2607, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 23:48:42,430 INFO L87 Difference]: Start difference. First operand 1221 states and 1775 transitions. Second operand has 56 states, 56 states have (on average 3.6964285714285716) internal successors, (207), 55 states have internal predecessors, (207), 13 states have call successors, (165), 7 states have call predecessors, (165), 14 states have return successors, (167), 14 states have call predecessors, (167), 13 states have call successors, (167)