./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_operatoramount_amount250_file-67.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 6953ac45278a08a3cd7aa6bba766924b380e26c77e34faa3b5c408a0e5b4f283 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:13:57,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:13:57,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:13:57,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:13:57,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:13:57,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:13:57,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:13:57,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:13:57,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:13:57,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:13:57,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:13:57,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:13:57,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:13:57,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:13:57,900 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:13:57,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:13:57,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:13:57,900 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:13:57,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:13:57,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:13:57,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:13:57,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:13:57,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:13:57,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:13:57,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:13:57,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:13:57,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:13:57,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:13:57,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:13:57,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:13:57,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:13:57,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:13:57,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:13:57,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:13:57,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:13:57,903 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 6953ac45278a08a3cd7aa6bba766924b380e26c77e34faa3b5c408a0e5b4f283 [2025-03-04 00:13:58,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:13:58,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:13:58,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:13:58,154 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:13:58,154 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:13:58,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i [2025-03-04 00:13:59,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447ae5cd6/1d330b9e1f0a40e29b2b965bbfe251a1/FLAGc60f28be9 [2025-03-04 00:13:59,680 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:13:59,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i [2025-03-04 00:13:59,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447ae5cd6/1d330b9e1f0a40e29b2b965bbfe251a1/FLAGc60f28be9 [2025-03-04 00:13:59,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447ae5cd6/1d330b9e1f0a40e29b2b965bbfe251a1 [2025-03-04 00:13:59,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:13:59,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:13:59,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:13:59,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:13:59,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:13:59,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:13:59" (1/1) ... [2025-03-04 00:13:59,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ea8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:59, skipping insertion in model container [2025-03-04 00:13:59,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:13:59" (1/1) ... [2025-03-04 00:13:59,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:14:00,097 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_operatoramount_amount250_file-67.i[916,929] [2025-03-04 00:14:00,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:14:00,255 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:14:00,265 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_operatoramount_amount250_file-67.i[916,929] [2025-03-04 00:14:00,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:14:00,331 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:14:00,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00 WrapperNode [2025-03-04 00:14:00,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:14:00,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:14:00,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:14:00,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:14:00,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,414 INFO L138 Inliner]: procedures = 26, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 540 [2025-03-04 00:14:00,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:14:00,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:14:00,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:14:00,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:14:00,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,461 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-04 00:14:00,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:14:00,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:14:00,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:14:00,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:14:00,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (1/1) ... [2025-03-04 00:14:00,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:14:00,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:00,540 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-04 00:14:00,545 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-04 00:14:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:14:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:14:00,562 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:14:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:14:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:14:00,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:14:00,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:14:00,658 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:14:01,263 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc property_#t~bitwise43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~bitwise47#1;havoc property_#t~ite50#1;havoc property_#t~bitwise48#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1;havoc property_#t~bitwise52#1;havoc property_#t~bitwise53#1;havoc property_#t~short54#1;havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~short57#1; [2025-03-04 00:14:01,338 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-03-04 00:14:01,339 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:14:01,370 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:14:01,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:14:01,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:14:01 BoogieIcfgContainer [2025-03-04 00:14:01,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:14:01,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:14:01,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:14:01,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:14:01,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:13:59" (1/3) ... [2025-03-04 00:14:01,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e14a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:14:01, skipping insertion in model container [2025-03-04 00:14:01,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:00" (2/3) ... [2025-03-04 00:14:01,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e14a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:14:01, skipping insertion in model container [2025-03-04 00:14:01,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:14:01" (3/3) ... [2025-03-04 00:14:01,379 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-67.i [2025-03-04 00:14:01,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:14:01,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-67.i that has 2 procedures, 214 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:14:01,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:14:01,454 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;@27f078e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:14:01,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:14:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 159 states have (on average 1.490566037735849) internal successors, (237), 160 states have internal predecessors, (237), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 00:14:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-04 00:14:01,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:01,477 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:01,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:01,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:01,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2120410671, now seen corresponding path program 1 times [2025-03-04 00:14:01,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:01,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774175942] [2025-03-04 00:14:01,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:01,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:14:01,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:14:01,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-03-04 00:14:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:01,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774175942] [2025-03-04 00:14:01,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774175942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:01,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618421185] [2025-03-04 00:14:01,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:01,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:01,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:01,952 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-04 00:14:01,954 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-04 00:14:02,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:14:02,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:14:02,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:02,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:02,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:14:02,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-03-04 00:14:02,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:14:02,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618421185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:02,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:14:02,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:14:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834824297] [2025-03-04 00:14:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:02,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:14:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:02,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:14:02,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:14:02,236 INFO L87 Difference]: Start difference. First operand has 214 states, 159 states have (on average 1.490566037735849) internal successors, (237), 160 states have internal predecessors, (237), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-04 00:14:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:02,285 INFO L93 Difference]: Finished difference Result 418 states and 723 transitions. [2025-03-04 00:14:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:14:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 350 [2025-03-04 00:14:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:02,296 INFO L225 Difference]: With dead ends: 418 [2025-03-04 00:14:02,297 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 00:14:02,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 351 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-04 00:14:02,302 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:02,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:14:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 00:14:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-04 00:14:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.457516339869281) internal successors, (223), 153 states have internal predecessors, (223), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 00:14:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 327 transitions. [2025-03-04 00:14:02,357 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 327 transitions. Word has length 350 [2025-03-04 00:14:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:02,357 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 327 transitions. [2025-03-04 00:14:02,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-04 00:14:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 327 transitions. [2025-03-04 00:14:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-04 00:14:02,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:02,366 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:02,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:14:02,567 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-04 00:14:02,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:02,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash -858372892, now seen corresponding path program 1 times [2025-03-04 00:14:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:02,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070251597] [2025-03-04 00:14:02,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:02,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:14:02,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:14:02,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:02,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-04 00:14:03,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070251597] [2025-03-04 00:14:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070251597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248376192] [2025-03-04 00:14:03,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:03,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:03,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:03,399 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-04 00:14:03,401 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-04 00:14:03,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:14:03,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:14:03,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:03,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:03,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:14:03,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:03,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:14:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248376192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:03,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:14:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 00:14:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303250329] [2025-03-04 00:14:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:03,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:14:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:03,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:14:03,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:14:03,723 INFO L87 Difference]: Start difference. First operand 207 states and 327 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:03,824 INFO L93 Difference]: Finished difference Result 521 states and 824 transitions. [2025-03-04 00:14:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:14:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 350 [2025-03-04 00:14:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:03,831 INFO L225 Difference]: With dead ends: 521 [2025-03-04 00:14:03,831 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 00:14:03,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:14:03,833 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 167 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:03,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 609 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:14:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 00:14:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 221. [2025-03-04 00:14:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 167 states have (on average 1.467065868263473) internal successors, (245), 167 states have internal predecessors, (245), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 00:14:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 349 transitions. [2025-03-04 00:14:03,854 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 349 transitions. Word has length 350 [2025-03-04 00:14:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:03,856 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 349 transitions. [2025-03-04 00:14:03,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 349 transitions. [2025-03-04 00:14:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-04 00:14:03,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:03,860 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:03,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:14:04,062 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,SelfDestructingSolverStorable1 [2025-03-04 00:14:04,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:04,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2041720189, now seen corresponding path program 1 times [2025-03-04 00:14:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:04,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609466039] [2025-03-04 00:14:04,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:04,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:04,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:14:04,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:14:04,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:04,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-04 00:14:04,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609466039] [2025-03-04 00:14:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609466039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210986130] [2025-03-04 00:14:04,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:04,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:04,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:04,644 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-04 00:14:04,647 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-04 00:14:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:14:04,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:14:04,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:04,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:04,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:14:04,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:04,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:14:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210986130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:04,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:14:04,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 00:14:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345123344] [2025-03-04 00:14:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:04,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:14:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:04,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:14:04,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:14:04,890 INFO L87 Difference]: Start difference. First operand 221 states and 349 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:04,993 INFO L93 Difference]: Finished difference Result 655 states and 1037 transitions. [2025-03-04 00:14:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:14:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 350 [2025-03-04 00:14:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:04,997 INFO L225 Difference]: With dead ends: 655 [2025-03-04 00:14:04,997 INFO L226 Difference]: Without dead ends: 437 [2025-03-04 00:14:04,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:14:04,999 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 320 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:04,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 805 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:14:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-04 00:14:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2025-03-04 00:14:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 328 states have (on average 1.4634146341463414) internal successors, (480), 328 states have internal predecessors, (480), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:14:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 688 transitions. [2025-03-04 00:14:05,052 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 688 transitions. Word has length 350 [2025-03-04 00:14:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:05,054 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 688 transitions. [2025-03-04 00:14:05,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 688 transitions. [2025-03-04 00:14:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-04 00:14:05,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:05,059 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:05,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:14:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:05,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1411961148, now seen corresponding path program 1 times [2025-03-04 00:14:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213732060] [2025-03-04 00:14:05,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:05,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-04 00:14:05,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-04 00:14:05,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:05,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-04 00:14:05,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213732060] [2025-03-04 00:14:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213732060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750090098] [2025-03-04 00:14:05,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:05,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:05,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:05,718 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-04 00:14:05,719 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-04 00:14:05,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-04 00:14:05,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-04 00:14:05,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:05,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:05,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:14:05,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:06,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:14:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750090098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:06,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:14:06,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-04 00:14:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430662480] [2025-03-04 00:14:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:06,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:14:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:06,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:14:06,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:14:06,817 INFO L87 Difference]: Start difference. First operand 435 states and 688 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:07,235 INFO L93 Difference]: Finished difference Result 1443 states and 2279 transitions. [2025-03-04 00:14:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:14:07,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 351 [2025-03-04 00:14:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:07,241 INFO L225 Difference]: With dead ends: 1443 [2025-03-04 00:14:07,242 INFO L226 Difference]: Without dead ends: 1011 [2025-03-04 00:14:07,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:14:07,244 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 403 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:07,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1195 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:14:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-04 00:14:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 865. [2025-03-04 00:14:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 652 states have (on average 1.460122699386503) internal successors, (952), 652 states have internal predecessors, (952), 208 states have call successors, (208), 4 states have call predecessors, (208), 4 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-04 00:14:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1368 transitions. [2025-03-04 00:14:07,354 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1368 transitions. Word has length 351 [2025-03-04 00:14:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:07,357 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1368 transitions. [2025-03-04 00:14:07,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1368 transitions. [2025-03-04 00:14:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-04 00:14:07,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:07,361 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:07,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:14:07,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:07,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:07,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1668477129, now seen corresponding path program 1 times [2025-03-04 00:14:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434222943] [2025-03-04 00:14:07,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:07,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-04 00:14:07,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-04 00:14:07,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:07,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434222943] [2025-03-04 00:14:08,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434222943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:08,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:08,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:14:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443902246] [2025-03-04 00:14:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:08,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:14:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:08,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:14:08,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:14:08,666 INFO L87 Difference]: Start difference. First operand 865 states and 1368 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:10,220 INFO L93 Difference]: Finished difference Result 3968 states and 6208 transitions. [2025-03-04 00:14:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:14:10,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 352 [2025-03-04 00:14:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:10,236 INFO L225 Difference]: With dead ends: 3968 [2025-03-04 00:14:10,236 INFO L226 Difference]: Without dead ends: 3106 [2025-03-04 00:14:10,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:14:10,245 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 1376 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:10,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 2917 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:14:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-04 00:14:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1989. [2025-03-04 00:14:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1564 states have (on average 1.5012787723785166) internal successors, (2348), 1564 states have internal predecessors, (2348), 416 states have call successors, (416), 8 states have call predecessors, (416), 8 states have return successors, (416), 416 states have call predecessors, (416), 416 states have call successors, (416) [2025-03-04 00:14:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 3180 transitions. [2025-03-04 00:14:10,396 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 3180 transitions. Word has length 352 [2025-03-04 00:14:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:10,396 INFO L471 AbstractCegarLoop]: Abstraction has 1989 states and 3180 transitions. [2025-03-04 00:14:10,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 3180 transitions. [2025-03-04 00:14:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 00:14:10,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:10,401 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:10,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:14:10,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:10,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1250316996, now seen corresponding path program 1 times [2025-03-04 00:14:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:10,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218452720] [2025-03-04 00:14:10,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:10,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:10,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 00:14:10,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 00:14:10,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:10,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218452720] [2025-03-04 00:14:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218452720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:14:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373737746] [2025-03-04 00:14:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:11,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:14:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:11,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:14:11,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:14:11,303 INFO L87 Difference]: Start difference. First operand 1989 states and 3180 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:12,591 INFO L93 Difference]: Finished difference Result 4536 states and 7164 transitions. [2025-03-04 00:14:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:14:12,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 353 [2025-03-04 00:14:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:12,610 INFO L225 Difference]: With dead ends: 4536 [2025-03-04 00:14:12,611 INFO L226 Difference]: Without dead ends: 3674 [2025-03-04 00:14:12,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:14:12,617 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 2035 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:12,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 2169 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:14:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2025-03-04 00:14:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2045. [2025-03-04 00:14:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 1620 states have (on average 1.5037037037037038) internal successors, (2436), 1620 states have internal predecessors, (2436), 416 states have call successors, (416), 8 states have call predecessors, (416), 8 states have return successors, (416), 416 states have call predecessors, (416), 416 states have call successors, (416) [2025-03-04 00:14:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 3268 transitions. [2025-03-04 00:14:12,740 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 3268 transitions. Word has length 353 [2025-03-04 00:14:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:12,741 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 3268 transitions. [2025-03-04 00:14:12,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 3268 transitions. [2025-03-04 00:14:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 00:14:12,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:12,761 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:12,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:14:12,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:12,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1202386792, now seen corresponding path program 1 times [2025-03-04 00:14:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378805897] [2025-03-04 00:14:12,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:12,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 00:14:13,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 00:14:13,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:13,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378805897] [2025-03-04 00:14:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378805897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:13,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:14:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860495401] [2025-03-04 00:14:13,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:13,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:14:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:13,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:14:13,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:14:13,335 INFO L87 Difference]: Start difference. First operand 2045 states and 3268 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:13,836 INFO L93 Difference]: Finished difference Result 5961 states and 9538 transitions. [2025-03-04 00:14:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:14:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 353 [2025-03-04 00:14:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:13,853 INFO L225 Difference]: With dead ends: 5961 [2025-03-04 00:14:13,854 INFO L226 Difference]: Without dead ends: 3919 [2025-03-04 00:14:13,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:14:13,859 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 510 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:13,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1000 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:14:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-04 00:14:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3917. [2025-03-04 00:14:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3068 states have (on average 1.4967405475880051) internal successors, (4592), 3068 states have internal predecessors, (4592), 832 states have call successors, (832), 16 states have call predecessors, (832), 16 states have return successors, (832), 832 states have call predecessors, (832), 832 states have call successors, (832) [2025-03-04 00:14:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 6256 transitions. [2025-03-04 00:14:14,052 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 6256 transitions. Word has length 353 [2025-03-04 00:14:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:14,052 INFO L471 AbstractCegarLoop]: Abstraction has 3917 states and 6256 transitions. [2025-03-04 00:14:14,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 6256 transitions. [2025-03-04 00:14:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:14,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:14,059 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:14,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:14:14,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:14,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash 914082133, now seen corresponding path program 1 times [2025-03-04 00:14:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672494293] [2025-03-04 00:14:14,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:14,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:14,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:14,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:14,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672494293] [2025-03-04 00:14:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672494293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:14,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:14,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:14:14,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903304651] [2025-03-04 00:14:14,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:14:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:14,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:14:14,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:14:14,676 INFO L87 Difference]: Start difference. First operand 3917 states and 6256 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:16,685 INFO L93 Difference]: Finished difference Result 14988 states and 23887 transitions. [2025-03-04 00:14:16,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:14:16,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-04 00:14:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:16,746 INFO L225 Difference]: With dead ends: 14988 [2025-03-04 00:14:16,747 INFO L226 Difference]: Without dead ends: 11074 [2025-03-04 00:14:16,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:14:16,761 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1860 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:16,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 1847 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:14:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2025-03-04 00:14:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 9813. [2025-03-04 00:14:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 7692 states have (on average 1.499739989599584) internal successors, (11536), 7692 states have internal predecessors, (11536), 2080 states have call successors, (2080), 40 states have call predecessors, (2080), 40 states have return successors, (2080), 2080 states have call predecessors, (2080), 2080 states have call successors, (2080) [2025-03-04 00:14:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 15696 transitions. [2025-03-04 00:14:17,311 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 15696 transitions. Word has length 354 [2025-03-04 00:14:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:17,312 INFO L471 AbstractCegarLoop]: Abstraction has 9813 states and 15696 transitions. [2025-03-04 00:14:17,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 15696 transitions. [2025-03-04 00:14:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:17,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:17,346 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:17,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:14:17,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:17,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2027575466, now seen corresponding path program 1 times [2025-03-04 00:14:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802873436] [2025-03-04 00:14:17,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:17,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:17,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:17,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:17,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:17,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802873436] [2025-03-04 00:14:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802873436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:17,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:17,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:14:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414134406] [2025-03-04 00:14:17,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:17,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:14:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:17,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:14:17,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:14:17,728 INFO L87 Difference]: Start difference. First operand 9813 states and 15696 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:18,972 INFO L93 Difference]: Finished difference Result 33163 states and 53067 transitions. [2025-03-04 00:14:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:14:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-04 00:14:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:19,060 INFO L225 Difference]: With dead ends: 33163 [2025-03-04 00:14:19,061 INFO L226 Difference]: Without dead ends: 23353 [2025-03-04 00:14:19,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-04 00:14:19,097 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 512 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:19,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1145 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:14:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23353 states. [2025-03-04 00:14:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23353 to 23349. [2025-03-04 00:14:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23349 states, 18260 states have (on average 1.4955093099671413) internal successors, (27308), 18260 states have internal predecessors, (27308), 4992 states have call successors, (4992), 96 states have call predecessors, (4992), 96 states have return successors, (4992), 4992 states have call predecessors, (4992), 4992 states have call successors, (4992) [2025-03-04 00:14:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23349 states to 23349 states and 37292 transitions. [2025-03-04 00:14:20,268 INFO L78 Accepts]: Start accepts. Automaton has 23349 states and 37292 transitions. Word has length 354 [2025-03-04 00:14:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:20,269 INFO L471 AbstractCegarLoop]: Abstraction has 23349 states and 37292 transitions. [2025-03-04 00:14:20,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 23349 states and 37292 transitions. [2025-03-04 00:14:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:20,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:20,282 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:20,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:14:20,282 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:20,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 573075529, now seen corresponding path program 1 times [2025-03-04 00:14:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:20,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389797370] [2025-03-04 00:14:20,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:20,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:20,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:20,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:20,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:20,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:21,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:21,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389797370] [2025-03-04 00:14:21,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389797370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:21,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:21,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 00:14:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103708940] [2025-03-04 00:14:21,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:21,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:14:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:21,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:14:21,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:14:21,860 INFO L87 Difference]: Start difference. First operand 23349 states and 37292 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:24,782 INFO L93 Difference]: Finished difference Result 40218 states and 63433 transitions. [2025-03-04 00:14:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:14:24,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-04 00:14:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:24,886 INFO L225 Difference]: With dead ends: 40218 [2025-03-04 00:14:24,886 INFO L226 Difference]: Without dead ends: 30268 [2025-03-04 00:14:24,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:14:24,922 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1198 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:24,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2473 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 00:14:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30268 states. [2025-03-04 00:14:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30268 to 23321. [2025-03-04 00:14:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23321 states, 18232 states have (on average 1.4951733216322949) internal successors, (27260), 18232 states have internal predecessors, (27260), 4992 states have call successors, (4992), 96 states have call predecessors, (4992), 96 states have return successors, (4992), 4992 states have call predecessors, (4992), 4992 states have call successors, (4992) [2025-03-04 00:14:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23321 states to 23321 states and 37244 transitions. [2025-03-04 00:14:26,518 INFO L78 Accepts]: Start accepts. Automaton has 23321 states and 37244 transitions. Word has length 354 [2025-03-04 00:14:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:26,519 INFO L471 AbstractCegarLoop]: Abstraction has 23321 states and 37244 transitions. [2025-03-04 00:14:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 23321 states and 37244 transitions. [2025-03-04 00:14:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:26,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:26,605 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:26,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:14:26,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:26,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1504133814, now seen corresponding path program 1 times [2025-03-04 00:14:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:26,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449730503] [2025-03-04 00:14:26,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:26,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:26,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:26,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:26,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449730503] [2025-03-04 00:14:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449730503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:27,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:27,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:14:27,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573788283] [2025-03-04 00:14:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:27,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:14:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:27,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:14:27,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:14:27,403 INFO L87 Difference]: Start difference. First operand 23321 states and 37244 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:29,555 INFO L93 Difference]: Finished difference Result 44679 states and 70343 transitions. [2025-03-04 00:14:29,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:14:29,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-04 00:14:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:29,667 INFO L225 Difference]: With dead ends: 44679 [2025-03-04 00:14:29,667 INFO L226 Difference]: Without dead ends: 36333 [2025-03-04 00:14:29,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:14:29,702 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1107 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:29,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1739 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:14:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36333 states. [2025-03-04 00:14:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36333 to 23477. [2025-03-04 00:14:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23477 states, 18335 states have (on average 1.4946823016089446) internal successors, (27405), 18335 states have internal predecessors, (27405), 5044 states have call successors, (5044), 97 states have call predecessors, (5044), 97 states have return successors, (5044), 5044 states have call predecessors, (5044), 5044 states have call successors, (5044) [2025-03-04 00:14:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23477 states to 23477 states and 37493 transitions. [2025-03-04 00:14:31,518 INFO L78 Accepts]: Start accepts. Automaton has 23477 states and 37493 transitions. Word has length 354 [2025-03-04 00:14:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:31,518 INFO L471 AbstractCegarLoop]: Abstraction has 23477 states and 37493 transitions. [2025-03-04 00:14:31,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 23477 states and 37493 transitions. [2025-03-04 00:14:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:31,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:31,531 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:31,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:14:31,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1269187979, now seen corresponding path program 1 times [2025-03-04 00:14:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:31,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177550325] [2025-03-04 00:14:31,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:31,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:31,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:31,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:31,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:31,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177550325] [2025-03-04 00:14:31,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177550325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:31,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:31,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:14:31,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533994974] [2025-03-04 00:14:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:31,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:14:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:31,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:14:31,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:14:31,835 INFO L87 Difference]: Start difference. First operand 23477 states and 37493 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:32,846 INFO L93 Difference]: Finished difference Result 52465 states and 83571 transitions. [2025-03-04 00:14:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:14:32,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-04 00:14:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:32,932 INFO L225 Difference]: With dead ends: 52465 [2025-03-04 00:14:32,933 INFO L226 Difference]: Without dead ends: 29085 [2025-03-04 00:14:32,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:14:32,982 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 377 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:32,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 999 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:14:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29085 states. [2025-03-04 00:14:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29085 to 23335. [2025-03-04 00:14:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23335 states, 18246 states have (on average 1.4837224597171983) internal successors, (27072), 18246 states have internal predecessors, (27072), 4992 states have call successors, (4992), 96 states have call predecessors, (4992), 96 states have return successors, (4992), 4992 states have call predecessors, (4992), 4992 states have call successors, (4992) [2025-03-04 00:14:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23335 states to 23335 states and 37056 transitions. [2025-03-04 00:14:35,151 INFO L78 Accepts]: Start accepts. Automaton has 23335 states and 37056 transitions. Word has length 354 [2025-03-04 00:14:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:35,151 INFO L471 AbstractCegarLoop]: Abstraction has 23335 states and 37056 transitions. [2025-03-04 00:14:35,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-04 00:14:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 23335 states and 37056 transitions. [2025-03-04 00:14:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:14:35,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:35,159 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:35,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:14:35,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:35,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 529342860, now seen corresponding path program 1 times [2025-03-04 00:14:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:35,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654577395] [2025-03-04 00:14:35,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:35,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:14:35,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:14:35,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:35,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-04 00:14:35,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:35,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654577395] [2025-03-04 00:14:35,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654577395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:35,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:14:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170962544] [2025-03-04 00:14:35,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:35,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:14:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:35,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:14:35,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:14:35,910 INFO L87 Difference]: Start difference. First operand 23335 states and 37056 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-04 00:14:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:37,267 INFO L93 Difference]: Finished difference Result 49304 states and 78169 transitions. [2025-03-04 00:14:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:14:37,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 355 [2025-03-04 00:14:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:37,354 INFO L225 Difference]: With dead ends: 49304 [2025-03-04 00:14:37,354 INFO L226 Difference]: Without dead ends: 25972 [2025-03-04 00:14:37,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:14:37,393 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 259 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:37,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1360 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:14:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25972 states. [2025-03-04 00:14:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25972 to 23424. [2025-03-04 00:14:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23424 states, 18282 states have (on average 1.482769937643584) internal successors, (27108), 18282 states have internal predecessors, (27108), 5044 states have call successors, (5044), 97 states have call predecessors, (5044), 97 states have return successors, (5044), 5044 states have call predecessors, (5044), 5044 states have call successors, (5044) [2025-03-04 00:14:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23424 states to 23424 states and 37196 transitions. [2025-03-04 00:14:38,895 INFO L78 Accepts]: Start accepts. Automaton has 23424 states and 37196 transitions. Word has length 355 [2025-03-04 00:14:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:38,896 INFO L471 AbstractCegarLoop]: Abstraction has 23424 states and 37196 transitions. [2025-03-04 00:14:38,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-04 00:14:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 23424 states and 37196 transitions. [2025-03-04 00:14:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:14:38,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:38,900 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:38,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:14:38,900 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:38,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash 522599344, now seen corresponding path program 1 times [2025-03-04 00:14:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432292060] [2025-03-04 00:14:38,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:38,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:14:39,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:14:39,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:39,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 54 proven. 99 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-04 00:14:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432292060] [2025-03-04 00:14:40,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432292060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512826918] [2025-03-04 00:14:40,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:40,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:40,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:40,357 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-04 00:14:40,358 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-04 00:14:40,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:14:40,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:14:40,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:40,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:40,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:14:40,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1773 proven. 30 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2025-03-04 00:14:41,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:14:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 123 proven. 30 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-04 00:14:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512826918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:14:41,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:14:41,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 22 [2025-03-04 00:14:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989585958] [2025-03-04 00:14:41,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:14:41,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 00:14:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:41,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 00:14:41,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-04 00:14:41,581 INFO L87 Difference]: Start difference. First operand 23424 states and 37196 transitions. Second operand has 22 states, 21 states have (on average 11.285714285714286) internal successors, (237), 22 states have internal predecessors, (237), 7 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 7 states have call successors, (156) [2025-03-04 00:14:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:50,116 INFO L93 Difference]: Finished difference Result 91686 states and 143119 transitions. [2025-03-04 00:14:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-04 00:14:50,116 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 11.285714285714286) internal successors, (237), 22 states have internal predecessors, (237), 7 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 7 states have call successors, (156) Word has length 355 [2025-03-04 00:14:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:50,340 INFO L225 Difference]: With dead ends: 91686 [2025-03-04 00:14:50,340 INFO L226 Difference]: Without dead ends: 68354 [2025-03-04 00:14:50,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2144, Invalid=9412, Unknown=0, NotChecked=0, Total=11556 [2025-03-04 00:14:50,409 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 8901 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 1909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8970 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 5649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1909 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:50,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8970 Valid, 2928 Invalid, 5649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1909 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 00:14:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68354 states. [2025-03-04 00:14:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68354 to 33900. [2025-03-04 00:14:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33900 states, 27643 states have (on average 1.4756357848279853) internal successors, (40791), 27703 states have internal predecessors, (40791), 5972 states have call successors, (5972), 284 states have call predecessors, (5972), 284 states have return successors, (5972), 5912 states have call predecessors, (5972), 5972 states have call successors, (5972) [2025-03-04 00:14:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33900 states to 33900 states and 52735 transitions. [2025-03-04 00:14:53,661 INFO L78 Accepts]: Start accepts. Automaton has 33900 states and 52735 transitions. Word has length 355 [2025-03-04 00:14:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:53,662 INFO L471 AbstractCegarLoop]: Abstraction has 33900 states and 52735 transitions. [2025-03-04 00:14:53,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 11.285714285714286) internal successors, (237), 22 states have internal predecessors, (237), 7 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 7 states have call successors, (156) [2025-03-04 00:14:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 33900 states and 52735 transitions. [2025-03-04 00:14:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:14:53,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:53,668 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:53,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:14:53,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 00:14:53,868 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1678116343, now seen corresponding path program 1 times [2025-03-04 00:14:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300097226] [2025-03-04 00:14:53,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:53,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:14:54,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:14:54,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:54,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 105 proven. 48 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-04 00:14:54,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300097226] [2025-03-04 00:14:54,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300097226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785419098] [2025-03-04 00:14:54,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:54,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:54,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:14:54,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:14:54,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:14:54,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:14:54,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:54,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:54,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:14:54,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1863 proven. 45 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2025-03-04 00:14:54,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:14:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 255 proven. 48 refuted. 0 times theorem prover too weak. 5001 trivial. 0 not checked. [2025-03-04 00:14:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785419098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:14:55,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:14:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 23 [2025-03-04 00:14:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097325848] [2025-03-04 00:14:55,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:14:55,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:14:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:55,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:14:55,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:14:55,460 INFO L87 Difference]: Start difference. First operand 33900 states and 52735 transitions. Second operand has 23 states, 23 states have (on average 9.608695652173912) internal successors, (221), 23 states have internal predecessors, (221), 6 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (80), 6 states have call predecessors, (80), 6 states have call successors, (80) [2025-03-04 00:15:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:05,015 INFO L93 Difference]: Finished difference Result 119198 states and 179594 transitions. [2025-03-04 00:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 00:15:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.608695652173912) internal successors, (221), 23 states have internal predecessors, (221), 6 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (80), 6 states have call predecessors, (80), 6 states have call successors, (80) Word has length 355 [2025-03-04 00:15:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:05,372 INFO L225 Difference]: With dead ends: 119198 [2025-03-04 00:15:05,372 INFO L226 Difference]: Without dead ends: 85402 [2025-03-04 00:15:05,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2369, Invalid=9841, Unknown=0, NotChecked=0, Total=12210 [2025-03-04 00:15:05,448 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 2968 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 3792 mSolverCounterSat, 1686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2968 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 5478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1686 IncrementalHoareTripleChecker+Valid, 3792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:05,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2968 Valid, 2890 Invalid, 5478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1686 Valid, 3792 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 00:15:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85402 states. [2025-03-04 00:15:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85402 to 50778. [2025-03-04 00:15:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50778 states, 38877 states have (on average 1.40635851531754) internal successors, (54675), 39037 states have internal predecessors, (54675), 10792 states have call successors, (10792), 1108 states have call predecessors, (10792), 1108 states have return successors, (10792), 10632 states have call predecessors, (10792), 10792 states have call successors, (10792) [2025-03-04 00:15:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50778 states to 50778 states and 76259 transitions. [2025-03-04 00:15:10,647 INFO L78 Accepts]: Start accepts. Automaton has 50778 states and 76259 transitions. Word has length 355 [2025-03-04 00:15:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:10,648 INFO L471 AbstractCegarLoop]: Abstraction has 50778 states and 76259 transitions. [2025-03-04 00:15:10,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.608695652173912) internal successors, (221), 23 states have internal predecessors, (221), 6 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (80), 6 states have call predecessors, (80), 6 states have call successors, (80) [2025-03-04 00:15:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 50778 states and 76259 transitions. [2025-03-04 00:15:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-04 00:15:10,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:10,655 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:10,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:15:10,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 00:15:10,859 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:10,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1013716540, now seen corresponding path program 1 times [2025-03-04 00:15:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:10,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950214045] [2025-03-04 00:15:10,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:10,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:10,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:11,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:11,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:11,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 54 proven. 99 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-04 00:15:11,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950214045] [2025-03-04 00:15:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950214045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972889607] [2025-03-04 00:15:11,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:11,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:11,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:11,896 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:15:11,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:15:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:12,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:12,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:12,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:12,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:15:12,103 INFO L279 TraceCheckSpWp]: Computing forward predicates...