./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-1.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 ea9feee752dca5e5614c423318b7c590a6ae07e20bba2cfd8d20956282c64c55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:46:57,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:46:57,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:46:57,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:46:57,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:46:57,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:46:57,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:46:57,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:46:57,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:46:57,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:46:57,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:46:57,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:46:57,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:46:57,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:46:57,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:46:57,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:46:57,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:46:57,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:46:57,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:46:57,643 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 -> ea9feee752dca5e5614c423318b7c590a6ae07e20bba2cfd8d20956282c64c55 [2025-03-17 04:46:57,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:46:57,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:46:57,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:46:57,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:46:57,944 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:46:57,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-1.i [2025-03-17 04:46:59,184 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62b84408/95e0e08b2ff743509163266b61c727cd/FLAG852115306 [2025-03-17 04:46:59,489 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:46:59,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-1.i [2025-03-17 04:46:59,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62b84408/95e0e08b2ff743509163266b61c727cd/FLAG852115306 [2025-03-17 04:46:59,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62b84408/95e0e08b2ff743509163266b61c727cd [2025-03-17 04:46:59,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:46:59,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:46:59,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:46:59,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:46:59,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:46:59,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:46:59" (1/1) ... [2025-03-17 04:46:59,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f9ca31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:59, skipping insertion in model container [2025-03-17 04:46:59,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:46:59" (1/1) ... [2025-03-17 04:46:59,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:46:59,721 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_amount500_file-1.i[915,928] [2025-03-17 04:46:59,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:46:59,969 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:46:59,978 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_amount500_file-1.i[915,928] [2025-03-17 04:47:00,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:47:00,099 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:47:00,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00 WrapperNode [2025-03-17 04:47:00,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:47:00,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:47:00,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:47:00,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:47:00,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,250 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 750 [2025-03-17 04:47:00,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:47:00,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:47:00,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:47:00,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:47:00,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,376 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:47:00,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,412 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:47:00,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:47:00,462 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:47:00,462 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:47:00,463 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (1/1) ... [2025-03-17 04:47:00,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:47:00,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:00,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:47:00,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:47:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:47:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:47:00,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:47:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:47:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:47:00,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:47:00,667 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:47:00,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:47:01,822 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: havoc property_#t~ite49#1;havoc property_#t~bitwise47#1;havoc property_#t~bitwise48#1;havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~bitwise56#1;havoc property_#t~short57#1;havoc property_#t~ite62#1;havoc property_#t~ite61#1;havoc property_#t~bitwise58#1;havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~short65#1; [2025-03-17 04:47:01,971 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-17 04:47:01,972 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:47:01,997 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:47:01,998 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 04:47:01,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:47:01 BoogieIcfgContainer [2025-03-17 04:47:01,998 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:47:02,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:47:02,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:47:02,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:47:02,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:46:59" (1/3) ... [2025-03-17 04:47:02,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2a77e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:47:02, skipping insertion in model container [2025-03-17 04:47:02,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:00" (2/3) ... [2025-03-17 04:47:02,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2a77e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:47:02, skipping insertion in model container [2025-03-17 04:47:02,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:47:01" (3/3) ... [2025-03-17 04:47:02,011 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-1.i [2025-03-17 04:47:02,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:47:02,027 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-1.i that has 2 procedures, 292 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:47:02,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:47:02,105 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;@5f1ec346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:47:02,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:47:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 228 states have (on average 1.5614035087719298) internal successors, (356), 229 states have internal predecessors, (356), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-17 04:47:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 04:47:02,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:02,138 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:02,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:02,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash -382727899, now seen corresponding path program 1 times [2025-03-17 04:47:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199677771] [2025-03-17 04:47:02,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:02,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 04:47:02,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 04:47:02,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:02,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:03,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:03,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199677771] [2025-03-17 04:47:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199677771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:03,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:03,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29732679] [2025-03-17 04:47:03,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:03,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:03,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:03,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:03,657 INFO L87 Difference]: Start difference. First operand has 292 states, 228 states have (on average 1.5614035087719298) internal successors, (356), 229 states have internal predecessors, (356), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:04,036 INFO L93 Difference]: Finished difference Result 785 states and 1365 transitions. [2025-03-17 04:47:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:04,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 433 [2025-03-17 04:47:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:04,056 INFO L225 Difference]: With dead ends: 785 [2025-03-17 04:47:04,056 INFO L226 Difference]: Without dead ends: 494 [2025-03-17 04:47:04,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:04,065 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 273 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:04,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1312 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-17 04:47:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 491. [2025-03-17 04:47:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 411 states have (on average 1.5669099756690998) internal successors, (644), 412 states have internal predecessors, (644), 77 states have call successors, (77), 2 states have call predecessors, (77), 2 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 04:47:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 798 transitions. [2025-03-17 04:47:04,148 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 798 transitions. Word has length 433 [2025-03-17 04:47:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:04,150 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 798 transitions. [2025-03-17 04:47:04,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 798 transitions. [2025-03-17 04:47:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 04:47:04,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:04,158 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:04,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 04:47:04,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:04,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:04,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1835030054, now seen corresponding path program 1 times [2025-03-17 04:47:04,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:04,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083891177] [2025-03-17 04:47:04,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:04,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 04:47:04,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 04:47:04,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:04,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083891177] [2025-03-17 04:47:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083891177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:05,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:05,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246582329] [2025-03-17 04:47:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:05,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:05,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:05,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:05,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:05,075 INFO L87 Difference]: Start difference. First operand 491 states and 798 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:05,212 INFO L93 Difference]: Finished difference Result 1471 states and 2392 transitions. [2025-03-17 04:47:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 433 [2025-03-17 04:47:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:05,223 INFO L225 Difference]: With dead ends: 1471 [2025-03-17 04:47:05,226 INFO L226 Difference]: Without dead ends: 981 [2025-03-17 04:47:05,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:05,229 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 323 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:05,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 886 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-03-17 04:47:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 959. [2025-03-17 04:47:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 800 states have (on average 1.5625) internal successors, (1250), 802 states have internal predecessors, (1250), 154 states have call successors, (154), 4 states have call predecessors, (154), 4 states have return successors, (154), 152 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-17 04:47:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1558 transitions. [2025-03-17 04:47:05,325 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1558 transitions. Word has length 433 [2025-03-17 04:47:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:05,327 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1558 transitions. [2025-03-17 04:47:05,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1558 transitions. [2025-03-17 04:47:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 04:47:05,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:05,332 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:05,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:47:05,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:05,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1827270695, now seen corresponding path program 1 times [2025-03-17 04:47:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:05,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779347212] [2025-03-17 04:47:05,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:05,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 04:47:05,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 04:47:05,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:05,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:07,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779347212] [2025-03-17 04:47:07,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779347212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:07,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:07,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:07,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579661915] [2025-03-17 04:47:07,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:07,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:07,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:07,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:07,301 INFO L87 Difference]: Start difference. First operand 959 states and 1558 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:07,962 INFO L93 Difference]: Finished difference Result 2633 states and 4272 transitions. [2025-03-17 04:47:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:47:07,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 433 [2025-03-17 04:47:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:07,974 INFO L225 Difference]: With dead ends: 2633 [2025-03-17 04:47:07,974 INFO L226 Difference]: Without dead ends: 1675 [2025-03-17 04:47:07,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:47:07,980 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 638 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:07,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1589 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:47:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2025-03-17 04:47:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1081. [2025-03-17 04:47:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 860 states have (on average 1.5348837209302326) internal successors, (1320), 862 states have internal predecessors, (1320), 215 states have call successors, (215), 5 states have call predecessors, (215), 5 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2025-03-17 04:47:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1750 transitions. [2025-03-17 04:47:08,139 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1750 transitions. Word has length 433 [2025-03-17 04:47:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:08,140 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1750 transitions. [2025-03-17 04:47:08,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1750 transitions. [2025-03-17 04:47:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 04:47:08,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:08,147 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:08,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:47:08,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:08,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1896445368, now seen corresponding path program 1 times [2025-03-17 04:47:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:08,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068510168] [2025-03-17 04:47:08,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 04:47:08,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 04:47:08,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:08,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:09,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:09,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068510168] [2025-03-17 04:47:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068510168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:09,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094233741] [2025-03-17 04:47:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:09,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:09,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:09,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:09,528 INFO L87 Difference]: Start difference. First operand 1081 states and 1750 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:09,716 INFO L93 Difference]: Finished difference Result 2665 states and 4326 transitions. [2025-03-17 04:47:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:09,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 433 [2025-03-17 04:47:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:09,729 INFO L225 Difference]: With dead ends: 2665 [2025-03-17 04:47:09,729 INFO L226 Difference]: Without dead ends: 1707 [2025-03-17 04:47:09,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:09,733 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 261 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:09,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1584 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-03-17 04:47:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1289. [2025-03-17 04:47:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1068 states have (on average 1.5580524344569289) internal successors, (1664), 1070 states have internal predecessors, (1664), 215 states have call successors, (215), 5 states have call predecessors, (215), 5 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2025-03-17 04:47:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2094 transitions. [2025-03-17 04:47:09,816 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2094 transitions. Word has length 433 [2025-03-17 04:47:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:09,817 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 2094 transitions. [2025-03-17 04:47:09,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2094 transitions. [2025-03-17 04:47:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-17 04:47:09,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:09,823 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:09,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:47:09,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:09,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1828084005, now seen corresponding path program 1 times [2025-03-17 04:47:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:09,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871899635] [2025-03-17 04:47:09,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:09,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-17 04:47:10,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-17 04:47:10,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:10,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:11,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871899635] [2025-03-17 04:47:11,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871899635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:11,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606691805] [2025-03-17 04:47:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:11,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:11,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:11,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:11,265 INFO L87 Difference]: Start difference. First operand 1289 states and 2094 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-17 04:47:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:12,012 INFO L93 Difference]: Finished difference Result 3229 states and 5241 transitions. [2025-03-17 04:47:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 434 [2025-03-17 04:47:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:12,026 INFO L225 Difference]: With dead ends: 3229 [2025-03-17 04:47:12,026 INFO L226 Difference]: Without dead ends: 2063 [2025-03-17 04:47:12,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:12,031 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 1004 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:12,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 780 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:47:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-03-17 04:47:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2059. [2025-03-17 04:47:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 1765 states have (on average 1.5654390934844193) internal successors, (2763), 1771 states have internal predecessors, (2763), 283 states have call successors, (283), 10 states have call predecessors, (283), 10 states have return successors, (283), 277 states have call predecessors, (283), 283 states have call successors, (283) [2025-03-17 04:47:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 3329 transitions. [2025-03-17 04:47:12,273 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 3329 transitions. Word has length 434 [2025-03-17 04:47:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:12,275 INFO L471 AbstractCegarLoop]: Abstraction has 2059 states and 3329 transitions. [2025-03-17 04:47:12,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-17 04:47:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 3329 transitions. [2025-03-17 04:47:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-17 04:47:12,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:12,286 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:12,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:47:12,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:12,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2108433894, now seen corresponding path program 1 times [2025-03-17 04:47:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:12,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683036854] [2025-03-17 04:47:12,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:12,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-17 04:47:12,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-17 04:47:12,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:12,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:13,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:13,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683036854] [2025-03-17 04:47:13,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683036854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:13,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907480874] [2025-03-17 04:47:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:13,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:13,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:13,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:13,602 INFO L87 Difference]: Start difference. First operand 2059 states and 3329 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:14,188 INFO L93 Difference]: Finished difference Result 6809 states and 10978 transitions. [2025-03-17 04:47:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:47:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 434 [2025-03-17 04:47:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:14,214 INFO L225 Difference]: With dead ends: 6809 [2025-03-17 04:47:14,214 INFO L226 Difference]: Without dead ends: 4871 [2025-03-17 04:47:14,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-17 04:47:14,224 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 642 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:14,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 2051 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2025-03-17 04:47:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3995. [2025-03-17 04:47:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3471 states have (on average 1.5721694036300777) internal successors, (5457), 3483 states have internal predecessors, (5457), 505 states have call successors, (505), 18 states have call predecessors, (505), 18 states have return successors, (505), 493 states have call predecessors, (505), 505 states have call successors, (505) [2025-03-17 04:47:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 6467 transitions. [2025-03-17 04:47:14,531 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 6467 transitions. Word has length 434 [2025-03-17 04:47:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:14,532 INFO L471 AbstractCegarLoop]: Abstraction has 3995 states and 6467 transitions. [2025-03-17 04:47:14,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 6467 transitions. [2025-03-17 04:47:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-17 04:47:14,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:14,541 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:14,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:47:14,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:14,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash -978615227, now seen corresponding path program 1 times [2025-03-17 04:47:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034876609] [2025-03-17 04:47:14,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:14,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-17 04:47:14,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-17 04:47:14,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:14,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:15,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034876609] [2025-03-17 04:47:15,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034876609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:15,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:15,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218808168] [2025-03-17 04:47:15,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:15,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:15,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:15,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:15,790 INFO L87 Difference]: Start difference. First operand 3995 states and 6467 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:16,661 INFO L93 Difference]: Finished difference Result 11801 states and 19062 transitions. [2025-03-17 04:47:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 434 [2025-03-17 04:47:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:16,714 INFO L225 Difference]: With dead ends: 11801 [2025-03-17 04:47:16,714 INFO L226 Difference]: Without dead ends: 7935 [2025-03-17 04:47:16,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:16,731 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 355 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:16,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1150 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:47:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2025-03-17 04:47:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 7933. [2025-03-17 04:47:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7933 states, 6932 states have (on average 1.566935949221004) internal successors, (10862), 6956 states have internal predecessors, (10862), 949 states have call successors, (949), 51 states have call predecessors, (949), 51 states have return successors, (949), 925 states have call predecessors, (949), 949 states have call successors, (949) [2025-03-17 04:47:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7933 states to 7933 states and 12760 transitions. [2025-03-17 04:47:17,390 INFO L78 Accepts]: Start accepts. Automaton has 7933 states and 12760 transitions. Word has length 434 [2025-03-17 04:47:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:17,392 INFO L471 AbstractCegarLoop]: Abstraction has 7933 states and 12760 transitions. [2025-03-17 04:47:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7933 states and 12760 transitions. [2025-03-17 04:47:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-17 04:47:17,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:17,420 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:17,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:47:17,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1262408007, now seen corresponding path program 1 times [2025-03-17 04:47:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269418198] [2025-03-17 04:47:17,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:17,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-17 04:47:18,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-17 04:47:18,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:18,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:18,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:18,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269418198] [2025-03-17 04:47:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269418198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:18,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648650823] [2025-03-17 04:47:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:18,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:18,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:18,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:18,515 INFO L87 Difference]: Start difference. First operand 7933 states and 12760 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:18,852 INFO L93 Difference]: Finished difference Result 15759 states and 25361 transitions. [2025-03-17 04:47:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 435 [2025-03-17 04:47:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:18,902 INFO L225 Difference]: With dead ends: 15759 [2025-03-17 04:47:18,902 INFO L226 Difference]: Without dead ends: 7965 [2025-03-17 04:47:18,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:18,921 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:18,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1337 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:47:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7965 states. [2025-03-17 04:47:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7965 to 7965. [2025-03-17 04:47:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 6964 states have (on average 1.564330844342332) internal successors, (10894), 6988 states have internal predecessors, (10894), 949 states have call successors, (949), 51 states have call predecessors, (949), 51 states have return successors, (949), 925 states have call predecessors, (949), 949 states have call successors, (949) [2025-03-17 04:47:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 12792 transitions. [2025-03-17 04:47:19,338 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 12792 transitions. Word has length 435 [2025-03-17 04:47:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:19,340 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 12792 transitions. [2025-03-17 04:47:19,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 12792 transitions. [2025-03-17 04:47:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-17 04:47:19,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:19,352 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:19,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:47:19,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:19,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1198997054, now seen corresponding path program 1 times [2025-03-17 04:47:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:19,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220154341] [2025-03-17 04:47:19,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:19,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:19,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-17 04:47:20,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-17 04:47:20,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:20,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220154341] [2025-03-17 04:47:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220154341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:21,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:47:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545684264] [2025-03-17 04:47:21,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:21,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:47:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:21,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:47:21,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:47:21,159 INFO L87 Difference]: Start difference. First operand 7965 states and 12792 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-17 04:47:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:22,402 INFO L93 Difference]: Finished difference Result 18805 states and 30133 transitions. [2025-03-17 04:47:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:47:22,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 436 [2025-03-17 04:47:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:22,452 INFO L225 Difference]: With dead ends: 18805 [2025-03-17 04:47:22,453 INFO L226 Difference]: Without dead ends: 10979 [2025-03-17 04:47:22,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:47:22,481 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 971 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:22,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1078 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 04:47:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2025-03-17 04:47:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 10353. [2025-03-17 04:47:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10353 states, 9343 states have (on average 1.5730493417531841) internal successors, (14697), 9367 states have internal predecessors, (14697), 949 states have call successors, (949), 60 states have call predecessors, (949), 60 states have return successors, (949), 925 states have call predecessors, (949), 949 states have call successors, (949) [2025-03-17 04:47:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10353 states to 10353 states and 16595 transitions. [2025-03-17 04:47:23,067 INFO L78 Accepts]: Start accepts. Automaton has 10353 states and 16595 transitions. Word has length 436 [2025-03-17 04:47:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:23,070 INFO L471 AbstractCegarLoop]: Abstraction has 10353 states and 16595 transitions. [2025-03-17 04:47:23,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-17 04:47:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10353 states and 16595 transitions. [2025-03-17 04:47:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-17 04:47:23,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:23,086 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:23,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:47:23,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:23,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2041906402, now seen corresponding path program 1 times [2025-03-17 04:47:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730883149] [2025-03-17 04:47:23,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:23,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-17 04:47:24,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-17 04:47:24,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:24,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3 proven. 177 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730883149] [2025-03-17 04:47:24,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730883149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858922415] [2025-03-17 04:47:24,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:24,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:47:24,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:47:24,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-17 04:47:25,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-17 04:47:25,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:25,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:25,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 04:47:25,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3907 proven. 198 refuted. 0 times theorem prover too weak. 3215 trivial. 0 not checked. [2025-03-17 04:47:26,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:47:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 156 proven. 201 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2025-03-17 04:47:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858922415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:47:26,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:47:26,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-17 04:47:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742745606] [2025-03-17 04:47:26,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:47:26,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 04:47:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:26,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 04:47:26,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:47:26,796 INFO L87 Difference]: Start difference. First operand 10353 states and 16595 transitions. Second operand has 15 states, 15 states have (on average 16.866666666666667) internal successors, (253), 15 states have internal predecessors, (253), 6 states have call successors, (155), 3 states have call predecessors, (155), 7 states have return successors, (157), 6 states have call predecessors, (157), 6 states have call successors, (157) [2025-03-17 04:47:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:28,138 INFO L93 Difference]: Finished difference Result 19337 states and 30543 transitions. [2025-03-17 04:47:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 04:47:28,142 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 16.866666666666667) internal successors, (253), 15 states have internal predecessors, (253), 6 states have call successors, (155), 3 states have call predecessors, (155), 7 states have return successors, (157), 6 states have call predecessors, (157), 6 states have call successors, (157) Word has length 436 [2025-03-17 04:47:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:28,176 INFO L225 Difference]: With dead ends: 19337 [2025-03-17 04:47:28,176 INFO L226 Difference]: Without dead ends: 9127 [2025-03-17 04:47:28,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 864 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2025-03-17 04:47:28,196 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 582 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:28,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1191 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:47:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2025-03-17 04:47:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 8861. [2025-03-17 04:47:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8861 states, 7800 states have (on average 1.5274358974358975) internal successors, (11914), 7824 states have internal predecessors, (11914), 949 states have call successors, (949), 111 states have call predecessors, (949), 111 states have return successors, (949), 925 states have call predecessors, (949), 949 states have call successors, (949) [2025-03-17 04:47:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8861 states to 8861 states and 13812 transitions. [2025-03-17 04:47:28,868 INFO L78 Accepts]: Start accepts. Automaton has 8861 states and 13812 transitions. Word has length 436 [2025-03-17 04:47:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:28,869 INFO L471 AbstractCegarLoop]: Abstraction has 8861 states and 13812 transitions. [2025-03-17 04:47:28,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.866666666666667) internal successors, (253), 15 states have internal predecessors, (253), 6 states have call successors, (155), 3 states have call predecessors, (155), 7 states have return successors, (157), 6 states have call predecessors, (157), 6 states have call successors, (157) [2025-03-17 04:47:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 8861 states and 13812 transitions. [2025-03-17 04:47:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-17 04:47:28,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:28,883 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:28,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:47:29,088 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,SelfDestructingSolverStorable9 [2025-03-17 04:47:29,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:29,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1874913884, now seen corresponding path program 1 times [2025-03-17 04:47:29,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:29,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830286558] [2025-03-17 04:47:29,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:29,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:29,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-17 04:47:29,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-17 04:47:29,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:29,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830286558] [2025-03-17 04:47:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830286558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:30,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:47:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236339926] [2025-03-17 04:47:30,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:30,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:47:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:30,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:47:30,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:47:30,229 INFO L87 Difference]: Start difference. First operand 8861 states and 13812 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:31,338 INFO L93 Difference]: Finished difference Result 32067 states and 50079 transitions. [2025-03-17 04:47:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:47:31,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 436 [2025-03-17 04:47:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:31,416 INFO L225 Difference]: With dead ends: 32067 [2025-03-17 04:47:31,417 INFO L226 Difference]: Without dead ends: 23361 [2025-03-17 04:47:31,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:47:31,444 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1018 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:31,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 2224 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23361 states. [2025-03-17 04:47:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23361 to 23101. [2025-03-17 04:47:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23101 states, 21592 states have (on average 1.5514079288625418) internal successors, (33498), 21680 states have internal predecessors, (33498), 1269 states have call successors, (1269), 239 states have call predecessors, (1269), 239 states have return successors, (1269), 1181 states have call predecessors, (1269), 1269 states have call successors, (1269) [2025-03-17 04:47:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23101 states to 23101 states and 36036 transitions. [2025-03-17 04:47:32,299 INFO L78 Accepts]: Start accepts. Automaton has 23101 states and 36036 transitions. Word has length 436 [2025-03-17 04:47:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:32,300 INFO L471 AbstractCegarLoop]: Abstraction has 23101 states and 36036 transitions. [2025-03-17 04:47:32,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 23101 states and 36036 transitions. [2025-03-17 04:47:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-17 04:47:32,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:32,330 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:32,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:47:32,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:32,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1575581541, now seen corresponding path program 1 times [2025-03-17 04:47:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798295170] [2025-03-17 04:47:32,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:32,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-17 04:47:33,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-17 04:47:33,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:33,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 12 proven. 168 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:34,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:34,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798295170] [2025-03-17 04:47:34,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798295170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833166123] [2025-03-17 04:47:34,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:34,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:34,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:34,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:47:34,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:47:34,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-17 04:47:34,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-17 04:47:34,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:34,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:34,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 04:47:34,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3700 proven. 96 refuted. 0 times theorem prover too weak. 3524 trivial. 0 not checked. [2025-03-17 04:47:35,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:47:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 84 proven. 96 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833166123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:47:35,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:47:35,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-17 04:47:35,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597755448] [2025-03-17 04:47:35,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:47:35,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 04:47:35,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:35,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 04:47:35,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:47:35,912 INFO L87 Difference]: Start difference. First operand 23101 states and 36036 transitions. Second operand has 14 states, 14 states have (on average 20.928571428571427) internal successors, (293), 14 states have internal predecessors, (293), 5 states have call successors, (178), 3 states have call predecessors, (178), 6 states have return successors, (179), 5 states have call predecessors, (179), 5 states have call successors, (179) [2025-03-17 04:47:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:40,367 INFO L93 Difference]: Finished difference Result 58403 states and 90162 transitions. [2025-03-17 04:47:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-17 04:47:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.928571428571427) internal successors, (293), 14 states have internal predecessors, (293), 5 states have call successors, (178), 3 states have call predecessors, (178), 6 states have return successors, (179), 5 states have call predecessors, (179), 5 states have call successors, (179) Word has length 436 [2025-03-17 04:47:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:40,479 INFO L225 Difference]: With dead ends: 58403 [2025-03-17 04:47:40,479 INFO L226 Difference]: Without dead ends: 35457 [2025-03-17 04:47:40,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=742, Invalid=2564, Unknown=0, NotChecked=0, Total=3306 [2025-03-17 04:47:40,508 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2907 mSDsluCounter, 2840 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2913 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:40,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2913 Valid, 3395 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [828 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 04:47:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35457 states. [2025-03-17 04:47:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35457 to 25797. [2025-03-17 04:47:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25797 states, 24097 states have (on average 1.5521849192845583) internal successors, (37403), 24169 states have internal predecessors, (37403), 1389 states have call successors, (1389), 310 states have call predecessors, (1389), 310 states have return successors, (1389), 1317 states have call predecessors, (1389), 1389 states have call successors, (1389) [2025-03-17 04:47:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25797 states to 25797 states and 40181 transitions. [2025-03-17 04:47:41,761 INFO L78 Accepts]: Start accepts. Automaton has 25797 states and 40181 transitions. Word has length 436 [2025-03-17 04:47:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:41,762 INFO L471 AbstractCegarLoop]: Abstraction has 25797 states and 40181 transitions. [2025-03-17 04:47:41,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.928571428571427) internal successors, (293), 14 states have internal predecessors, (293), 5 states have call successors, (178), 3 states have call predecessors, (178), 6 states have return successors, (179), 5 states have call predecessors, (179), 5 states have call successors, (179) [2025-03-17 04:47:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 25797 states and 40181 transitions. [2025-03-17 04:47:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-17 04:47:41,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:41,786 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:41,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:47:41,986 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,SelfDestructingSolverStorable11 [2025-03-17 04:47:41,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:41,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1833254680, now seen corresponding path program 1 times [2025-03-17 04:47:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:41,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554858401] [2025-03-17 04:47:41,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:42,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-17 04:47:43,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-17 04:47:43,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:43,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554858401] [2025-03-17 04:47:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554858401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030340212] [2025-03-17 04:47:44,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:44,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:44,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:44,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:47:44,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:47:44,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-17 04:47:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-17 04:47:44,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:44,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:44,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:47:44,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:44,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:47:44,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030340212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:44,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:47:44,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-17 04:47:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452842443] [2025-03-17 04:47:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:44,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:44,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:44,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:47:44,481 INFO L87 Difference]: Start difference. First operand 25797 states and 40181 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 2 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:45,603 INFO L93 Difference]: Finished difference Result 51833 states and 80531 transitions. [2025-03-17 04:47:45,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:47:45,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 2 states have call predecessors, (61), 1 states have call successors, (61) Word has length 437 [2025-03-17 04:47:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:45,671 INFO L225 Difference]: With dead ends: 51833 [2025-03-17 04:47:45,672 INFO L226 Difference]: Without dead ends: 26203 [2025-03-17 04:47:45,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:47:45,692 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 370 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:45,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1004 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26203 states. [2025-03-17 04:47:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26203 to 25833. [2025-03-17 04:47:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25833 states, 24124 states have (on average 1.5495771845465096) internal successors, (37382), 24196 states have internal predecessors, (37382), 1389 states have call successors, (1389), 319 states have call predecessors, (1389), 319 states have return successors, (1389), 1317 states have call predecessors, (1389), 1389 states have call successors, (1389) [2025-03-17 04:47:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 40160 transitions. [2025-03-17 04:47:46,793 INFO L78 Accepts]: Start accepts. Automaton has 25833 states and 40160 transitions. Word has length 437 [2025-03-17 04:47:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:46,794 INFO L471 AbstractCegarLoop]: Abstraction has 25833 states and 40160 transitions. [2025-03-17 04:47:46,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 2 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 25833 states and 40160 transitions. [2025-03-17 04:47:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-17 04:47:46,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:46,812 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:46,821 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-17 04:47:47,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:47,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1349579353, now seen corresponding path program 1 times [2025-03-17 04:47:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427112116] [2025-03-17 04:47:47,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:47,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-17 04:47:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-17 04:47:48,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427112116] [2025-03-17 04:47:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427112116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464842226] [2025-03-17 04:47:48,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:48,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:48,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:48,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:47:48,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 04:47:48,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-17 04:47:48,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-17 04:47:48,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:48,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:48,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:47:48,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2850 proven. 45 refuted. 0 times theorem prover too weak. 4425 trivial. 0 not checked. [2025-03-17 04:47:49,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:47:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464842226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:47:49,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:47:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 04:47:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341395756] [2025-03-17 04:47:49,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:47:49,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:47:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:49,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:47:49,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:47:49,496 INFO L87 Difference]: Start difference. First operand 25833 states and 40160 transitions. Second operand has 9 states, 9 states have (on average 31.0) internal successors, (279), 9 states have internal predecessors, (279), 4 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (132), 4 states have call predecessors, (132), 4 states have call successors, (132) [2025-03-17 04:47:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:50,672 INFO L93 Difference]: Finished difference Result 39961 states and 61793 transitions. [2025-03-17 04:47:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 04:47:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.0) internal successors, (279), 9 states have internal predecessors, (279), 4 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (132), 4 states have call predecessors, (132), 4 states have call successors, (132) Word has length 437 [2025-03-17 04:47:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:50,719 INFO L225 Difference]: With dead ends: 39961 [2025-03-17 04:47:50,719 INFO L226 Difference]: Without dead ends: 14299 [2025-03-17 04:47:50,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 871 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-17 04:47:50,744 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1093 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:50,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 935 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:47:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2025-03-17 04:47:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 14089. [2025-03-17 04:47:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14089 states, 12690 states have (on average 1.5044917257683215) internal successors, (19092), 12722 states have internal predecessors, (19092), 1149 states have call successors, (1149), 249 states have call predecessors, (1149), 249 states have return successors, (1149), 1117 states have call predecessors, (1149), 1149 states have call successors, (1149) [2025-03-17 04:47:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14089 states to 14089 states and 21390 transitions. [2025-03-17 04:47:51,387 INFO L78 Accepts]: Start accepts. Automaton has 14089 states and 21390 transitions. Word has length 437 [2025-03-17 04:47:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:51,387 INFO L471 AbstractCegarLoop]: Abstraction has 14089 states and 21390 transitions. [2025-03-17 04:47:51,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.0) internal successors, (279), 9 states have internal predecessors, (279), 4 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (132), 4 states have call predecessors, (132), 4 states have call successors, (132) [2025-03-17 04:47:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 14089 states and 21390 transitions. [2025-03-17 04:47:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-17 04:47:51,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:51,396 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:51,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 04:47:51,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:51,597 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2062331577, now seen corresponding path program 1 times [2025-03-17 04:47:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202236952] [2025-03-17 04:47:51,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:51,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-17 04:47:52,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 04:47:52,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:52,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 54 proven. 126 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202236952] [2025-03-17 04:47:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202236952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744117201] [2025-03-17 04:47:53,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:53,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:53,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:53,058 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-17 04:47:53,060 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-17 04:47:53,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-17 04:47:53,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 04:47:53,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:53,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:53,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:47:53,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3120 proven. 126 refuted. 0 times theorem prover too weak. 4074 trivial. 0 not checked. [2025-03-17 04:47:53,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:47:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 54 proven. 126 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744117201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:47:53,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:47:53,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 04:47:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439332715] [2025-03-17 04:47:53,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:47:53,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:47:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:53,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:47:53,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:47:53,836 INFO L87 Difference]: Start difference. First operand 14089 states and 21390 transitions. Second operand has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 3 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (146), 3 states have call predecessors, (146), 3 states have call successors, (146) [2025-03-17 04:47:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:54,896 INFO L93 Difference]: Finished difference Result 28277 states and 42804 transitions. [2025-03-17 04:47:54,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:47:54,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 3 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (146), 3 states have call predecessors, (146), 3 states have call successors, (146) Word has length 438 [2025-03-17 04:47:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:54,951 INFO L225 Difference]: With dead ends: 28277 [2025-03-17 04:47:54,951 INFO L226 Difference]: Without dead ends: 14367 [2025-03-17 04:47:54,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:47:54,969 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 281 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:54,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 916 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14367 states. [2025-03-17 04:47:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14367 to 14157. [2025-03-17 04:47:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14157 states, 12741 states have (on average 1.4999607566125108) internal successors, (19111), 12773 states have internal predecessors, (19111), 1149 states have call successors, (1149), 266 states have call predecessors, (1149), 266 states have return successors, (1149), 1117 states have call predecessors, (1149), 1149 states have call successors, (1149) [2025-03-17 04:47:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 21409 transitions. [2025-03-17 04:47:56,093 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 21409 transitions. Word has length 438 [2025-03-17 04:47:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:56,094 INFO L471 AbstractCegarLoop]: Abstraction has 14157 states and 21409 transitions. [2025-03-17 04:47:56,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 3 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (146), 3 states have call predecessors, (146), 3 states have call successors, (146) [2025-03-17 04:47:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 21409 transitions. [2025-03-17 04:47:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-17 04:47:56,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:56,105 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:56,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 04:47:56,306 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,SelfDestructingSolverStorable14 [2025-03-17 04:47:56,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:56,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash -912212263, now seen corresponding path program 1 times [2025-03-17 04:47:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:56,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640178197] [2025-03-17 04:47:56,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:56,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:56,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-17 04:47:57,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 04:47:57,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:57,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat