./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-5.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-5.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 eb1314039a089ae50ffa2cf06a09d28c366b7983113714c5c1bfc7b71c13fc9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:51:17,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:51:17,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:51:17,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:51:17,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:51:17,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:51:17,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:51:17,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:51:17,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:51:17,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:51:17,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:51:17,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:51:17,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:51:17,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:51:17,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:51:17,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:51:17,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:51:17,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:51:17,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:51:17,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:51:17,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:51:17,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:51:17,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:51:17,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:51:17,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:51:17,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:51:17,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:51:17,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:51:17,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:51:17,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:51:17,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:51:17,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:51:17,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:51:17,417 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 -> eb1314039a089ae50ffa2cf06a09d28c366b7983113714c5c1bfc7b71c13fc9d [2025-03-17 04:51:17,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:51:17,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:51:17,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:51:17,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:51:17,641 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:51:17,642 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-5.i [2025-03-17 04:51:18,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2779b5a/cda96571ed5d4d48960de33b6807fd12/FLAG7ecc50ab3 [2025-03-17 04:51:18,995 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:51:18,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-5.i [2025-03-17 04:51:19,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2779b5a/cda96571ed5d4d48960de33b6807fd12/FLAG7ecc50ab3 [2025-03-17 04:51:19,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2779b5a/cda96571ed5d4d48960de33b6807fd12 [2025-03-17 04:51:19,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:51:19,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:51:19,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:51:19,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:51:19,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:51:19,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55960d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19, skipping insertion in model container [2025-03-17 04:51:19,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:51:19,179 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-5.i[915,928] [2025-03-17 04:51:19,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:51:19,395 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:51:19,402 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-5.i[915,928] [2025-03-17 04:51:19,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:51:19,528 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:51:19,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19 WrapperNode [2025-03-17 04:51:19,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:51:19,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:51:19,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:51:19,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:51:19,533 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:51:19" (1/1) ... [2025-03-17 04:51:19,550 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:51:19" (1/1) ... [2025-03-17 04:51:19,627 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 877 [2025-03-17 04:51:19,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:51:19,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:51:19,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:51:19,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:51:19,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,711 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:51:19,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:51:19,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:51:19,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:51:19,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:51:19,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (1/1) ... [2025-03-17 04:51:19,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:51:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:51:19,790 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:51:19,792 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:51:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:51:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:51:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:51:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:51:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:51:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:51:19,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:51:19,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:51:20,739 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: havoc property_#t~ite70#1;havoc property_#t~ite69#1;havoc property_#t~ite68#1;havoc property_#t~ite67#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short71#1;havoc property_#t~bitwise72#1;havoc property_#t~short73#1;havoc property_#t~bitwise74#1;havoc property_#t~short75#1;havoc property_#t~ite77#1;havoc property_#t~bitwise76#1;havoc property_#t~short78#1;havoc property_#t~ite80#1;havoc property_#t~bitwise79#1;havoc property_#t~short81#1;havoc property_#t~bitwise82#1;havoc property_#t~ite86#1;havoc property_#t~bitwise83#1;havoc property_#t~ite85#1;havoc property_#t~bitwise84#1;havoc property_#t~short87#1;havoc property_#t~bitwise88#1;havoc property_#t~short89#1; [2025-03-17 04:51:20,891 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-17 04:51:20,891 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:51:20,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:51:20,927 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 04:51:20,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:51:20 BoogieIcfgContainer [2025-03-17 04:51:20,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:51:20,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:51:20,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:51:20,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:51:20,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:51:19" (1/3) ... [2025-03-17 04:51:20,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26607b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:51:20, skipping insertion in model container [2025-03-17 04:51:20,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:19" (2/3) ... [2025-03-17 04:51:20,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26607b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:51:20, skipping insertion in model container [2025-03-17 04:51:20,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:51:20" (3/3) ... [2025-03-17 04:51:20,934 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-5.i [2025-03-17 04:51:20,943 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:51:20,946 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-5.i that has 2 procedures, 352 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:51:20,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:51:21,009 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;@66bef43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:51:21,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:51:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 352 states, 260 states have (on average 1.5269230769230768) internal successors, (397), 261 states have internal predecessors, (397), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-17 04:51:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-17 04:51:21,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:21,041 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:21,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1667064880, now seen corresponding path program 1 times [2025-03-17 04:51:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:21,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598931367] [2025-03-17 04:51:21,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:21,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-17 04:51:21,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-17 04:51:21,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:21,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-03-17 04:51:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:21,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598931367] [2025-03-17 04:51:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598931367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:51:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952195606] [2025-03-17 04:51:21,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:21,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:51:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:51:21,609 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:51:21,611 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:51:21,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-17 04:51:21,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-17 04:51:21,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:21,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:21,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:51:21,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:51:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-03-17 04:51:21,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:51:21,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952195606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:21,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:51:21,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:51:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139397539] [2025-03-17 04:51:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:21,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:51:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:22,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:51:22,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:51:22,004 INFO L87 Difference]: Start difference. First operand has 352 states, 260 states have (on average 1.5269230769230768) internal successors, (397), 261 states have internal predecessors, (397), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-17 04:51:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:22,077 INFO L93 Difference]: Finished difference Result 701 states and 1237 transitions. [2025-03-17 04:51:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:51:22,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) Word has length 589 [2025-03-17 04:51:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:22,086 INFO L225 Difference]: With dead ends: 701 [2025-03-17 04:51:22,089 INFO L226 Difference]: Without dead ends: 350 [2025-03-17 04:51:22,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:51:22,096 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:22,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:51:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-17 04:51:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-03-17 04:51:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-17 04:51:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 569 transitions. [2025-03-17 04:51:22,169 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 569 transitions. Word has length 589 [2025-03-17 04:51:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:22,170 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 569 transitions. [2025-03-17 04:51:22,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-17 04:51:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 569 transitions. [2025-03-17 04:51:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 04:51:22,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:22,194 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:22,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:51:22,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:51:22,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:22,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1594940423, now seen corresponding path program 1 times [2025-03-17 04:51:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:22,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176375044] [2025-03-17 04:51:22,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:22,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 04:51:22,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 04:51:22,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:22,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-17 04:51:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176375044] [2025-03-17 04:51:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176375044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:22,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:22,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:51:22,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097461663] [2025-03-17 04:51:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:51:22,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:22,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:51:22,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:22,961 INFO L87 Difference]: Start difference. First operand 350 states and 569 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:23,103 INFO L93 Difference]: Finished difference Result 1044 states and 1697 transitions. [2025-03-17 04:51:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:51:23,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 590 [2025-03-17 04:51:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:23,110 INFO L225 Difference]: With dead ends: 1044 [2025-03-17 04:51:23,112 INFO L226 Difference]: Without dead ends: 695 [2025-03-17 04:51:23,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:23,114 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 543 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:23,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1578 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:51:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-17 04:51:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 373. [2025-03-17 04:51:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 282 states have (on average 1.5212765957446808) internal successors, (429), 282 states have internal predecessors, (429), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-17 04:51:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 607 transitions. [2025-03-17 04:51:23,172 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 607 transitions. Word has length 590 [2025-03-17 04:51:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:23,176 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 607 transitions. [2025-03-17 04:51:23,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 607 transitions. [2025-03-17 04:51:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 04:51:23,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:23,188 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:23,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:51:23,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:23,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1581407622, now seen corresponding path program 1 times [2025-03-17 04:51:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:23,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445050294] [2025-03-17 04:51:23,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:23,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:23,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 04:51:23,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 04:51:23,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:23,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-17 04:51:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445050294] [2025-03-17 04:51:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445050294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:51:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053895274] [2025-03-17 04:51:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:51:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:51:24,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:51:24,680 INFO L87 Difference]: Start difference. First operand 373 states and 607 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:25,207 INFO L93 Difference]: Finished difference Result 1267 states and 2075 transitions. [2025-03-17 04:51:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:51:25,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 590 [2025-03-17 04:51:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:25,213 INFO L225 Difference]: With dead ends: 1267 [2025-03-17 04:51:25,213 INFO L226 Difference]: Without dead ends: 895 [2025-03-17 04:51:25,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:51:25,215 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 660 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:25,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2377 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:51:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-17 04:51:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 520. [2025-03-17 04:51:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 339 states have (on average 1.4365781710914454) internal successors, (487), 339 states have internal predecessors, (487), 178 states have call successors, (178), 2 states have call predecessors, (178), 2 states have return successors, (178), 178 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-17 04:51:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 843 transitions. [2025-03-17 04:51:25,271 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 843 transitions. Word has length 590 [2025-03-17 04:51:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:25,272 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 843 transitions. [2025-03-17 04:51:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 843 transitions. [2025-03-17 04:51:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 04:51:25,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:25,275 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:25,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:51:25,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:25,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash -674635399, now seen corresponding path program 1 times [2025-03-17 04:51:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:25,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010197326] [2025-03-17 04:51:25,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:25,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 04:51:25,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 04:51:25,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-17 04:51:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010197326] [2025-03-17 04:51:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010197326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:26,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:51:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368611639] [2025-03-17 04:51:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:26,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:51:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:26,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:51:26,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:51:26,964 INFO L87 Difference]: Start difference. First operand 520 states and 843 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:27,447 INFO L93 Difference]: Finished difference Result 1462 states and 2366 transitions. [2025-03-17 04:51:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:51:27,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 590 [2025-03-17 04:51:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:27,458 INFO L225 Difference]: With dead ends: 1462 [2025-03-17 04:51:27,458 INFO L226 Difference]: Without dead ends: 1090 [2025-03-17 04:51:27,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:51:27,461 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 1245 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:27,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 1727 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:51:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-03-17 04:51:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 818. [2025-03-17 04:51:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 583 states have (on average 1.4819897084048028) internal successors, (864), 584 states have internal predecessors, (864), 230 states have call successors, (230), 4 states have call predecessors, (230), 4 states have return successors, (230), 229 states have call predecessors, (230), 230 states have call successors, (230) [2025-03-17 04:51:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1324 transitions. [2025-03-17 04:51:27,546 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1324 transitions. Word has length 590 [2025-03-17 04:51:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:27,547 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1324 transitions. [2025-03-17 04:51:27,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1324 transitions. [2025-03-17 04:51:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 04:51:27,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:27,551 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:51:27,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:27,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash -255118568, now seen corresponding path program 1 times [2025-03-17 04:51:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:27,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671891977] [2025-03-17 04:51:27,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:27,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:27,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 04:51:28,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 04:51:28,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:28,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 39 proven. 225 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-03-17 04:51:29,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671891977] [2025-03-17 04:51:29,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671891977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:51:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009368424] [2025-03-17 04:51:29,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:29,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:51:29,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:51:29,563 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:51:29,564 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:51:29,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 04:51:29,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 04:51:29,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:29,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:29,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:51:29,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:51:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 6864 proven. 180 refuted. 0 times theorem prover too weak. 8620 trivial. 0 not checked. [2025-03-17 04:51:30,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:51:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 84 proven. 180 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-03-17 04:51:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009368424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:51:30,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:51:30,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 04:51:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497080986] [2025-03-17 04:51:30,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:51:30,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 04:51:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:30,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 04:51:30,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:51:30,978 INFO L87 Difference]: Start difference. First operand 818 states and 1324 transitions. Second operand has 12 states, 12 states have (on average 26.333333333333332) internal successors, (316), 12 states have internal predecessors, (316), 4 states have call successors, (224), 2 states have call predecessors, (224), 4 states have return successors, (226), 4 states have call predecessors, (226), 4 states have call successors, (226) [2025-03-17 04:51:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:31,979 INFO L93 Difference]: Finished difference Result 1832 states and 2927 transitions. [2025-03-17 04:51:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 04:51:31,980 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.333333333333332) internal successors, (316), 12 states have internal predecessors, (316), 4 states have call successors, (224), 2 states have call predecessors, (224), 4 states have return successors, (226), 4 states have call predecessors, (226), 4 states have call successors, (226) Word has length 590 [2025-03-17 04:51:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:31,988 INFO L225 Difference]: With dead ends: 1832 [2025-03-17 04:51:31,989 INFO L226 Difference]: Without dead ends: 1166 [2025-03-17 04:51:31,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1178 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-17 04:51:31,993 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1053 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:31,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 1935 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:51:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-03-17 04:51:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1154. [2025-03-17 04:51:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 885 states have (on average 1.4757062146892654) internal successors, (1306), 888 states have internal predecessors, (1306), 256 states have call successors, (256), 12 states have call predecessors, (256), 12 states have return successors, (256), 253 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-17 04:51:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1818 transitions. [2025-03-17 04:51:32,062 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1818 transitions. Word has length 590 [2025-03-17 04:51:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:32,063 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1818 transitions. [2025-03-17 04:51:32,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.333333333333332) internal successors, (316), 12 states have internal predecessors, (316), 4 states have call successors, (224), 2 states have call predecessors, (224), 4 states have return successors, (226), 4 states have call predecessors, (226), 4 states have call successors, (226) [2025-03-17 04:51:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1818 transitions. [2025-03-17 04:51:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 04:51:32,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:32,067 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:32,076 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:51:32,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:51:32,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:32,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1486483384, now seen corresponding path program 1 times [2025-03-17 04:51:32,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:32,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949742955] [2025-03-17 04:51:32,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:32,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 04:51:32,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 04:51:32,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:32,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-17 04:51:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949742955] [2025-03-17 04:51:33,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949742955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:33,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:33,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 04:51:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544390769] [2025-03-17 04:51:33,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:33,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:51:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:33,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:51:33,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:51:33,940 INFO L87 Difference]: Start difference. First operand 1154 states and 1818 transitions. Second operand has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:37,040 INFO L93 Difference]: Finished difference Result 4718 states and 7392 transitions. [2025-03-17 04:51:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 04:51:37,041 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 590 [2025-03-17 04:51:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:37,058 INFO L225 Difference]: With dead ends: 4718 [2025-03-17 04:51:37,058 INFO L226 Difference]: Without dead ends: 3724 [2025-03-17 04:51:37,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:51:37,061 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 2358 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2358 SdHoareTripleChecker+Valid, 3992 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:37,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2358 Valid, 3992 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 04:51:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2025-03-17 04:51:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3197. [2025-03-17 04:51:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3197 states, 2705 states have (on average 1.5194085027726432) internal successors, (4110), 2716 states have internal predecessors, (4110), 463 states have call successors, (463), 28 states have call predecessors, (463), 28 states have return successors, (463), 452 states have call predecessors, (463), 463 states have call successors, (463) [2025-03-17 04:51:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 3197 states and 5036 transitions. [2025-03-17 04:51:37,280 INFO L78 Accepts]: Start accepts. Automaton has 3197 states and 5036 transitions. Word has length 590 [2025-03-17 04:51:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:37,281 INFO L471 AbstractCegarLoop]: Abstraction has 3197 states and 5036 transitions. [2025-03-17 04:51:37,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 5036 transitions. [2025-03-17 04:51:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-17 04:51:37,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:37,289 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:37,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:51:37,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:37,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1929808181, now seen corresponding path program 1 times [2025-03-17 04:51:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:37,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105697352] [2025-03-17 04:51:37,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:37,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-17 04:51:37,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-17 04:51:37,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:37,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-17 04:51:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105697352] [2025-03-17 04:51:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105697352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:51:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453916299] [2025-03-17 04:51:38,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:38,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:51:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:38,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:51:38,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:51:38,341 INFO L87 Difference]: Start difference. First operand 3197 states and 5036 transitions. Second operand has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 9 states have internal predecessors, (149), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:40,169 INFO L93 Difference]: Finished difference Result 8384 states and 13101 transitions. [2025-03-17 04:51:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:51:40,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 9 states have internal predecessors, (149), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 591 [2025-03-17 04:51:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:40,193 INFO L225 Difference]: With dead ends: 8384 [2025-03-17 04:51:40,193 INFO L226 Difference]: Without dead ends: 5347 [2025-03-17 04:51:40,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:51:40,199 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 2589 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:40,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 2413 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 04:51:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2025-03-17 04:51:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 4139. [2025-03-17 04:51:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4139 states, 3575 states have (on average 1.5155244755244754) internal successors, (5418), 3590 states have internal predecessors, (5418), 527 states have call successors, (527), 36 states have call predecessors, (527), 36 states have return successors, (527), 512 states have call predecessors, (527), 527 states have call successors, (527) [2025-03-17 04:51:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 6472 transitions. [2025-03-17 04:51:40,495 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 6472 transitions. Word has length 591 [2025-03-17 04:51:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:40,497 INFO L471 AbstractCegarLoop]: Abstraction has 4139 states and 6472 transitions. [2025-03-17 04:51:40,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 9 states have internal predecessors, (149), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-17 04:51:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 6472 transitions. [2025-03-17 04:51:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-17 04:51:40,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:40,505 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:40,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:51:40,505 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:40,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1921196757, now seen corresponding path program 1 times [2025-03-17 04:51:40,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:40,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909324614] [2025-03-17 04:51:40,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:40,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-17 04:51:41,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-17 04:51:41,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:41,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-17 04:51:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909324614] [2025-03-17 04:51:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909324614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 04:51:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680797063] [2025-03-17 04:51:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 04:51:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:42,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 04:51:42,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:51:42,727 INFO L87 Difference]: Start difference. First operand 4139 states and 6472 transitions. Second operand has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-17 04:51:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:47,180 INFO L93 Difference]: Finished difference Result 34582 states and 53713 transitions. [2025-03-17 04:51:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 04:51:47,181 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 591 [2025-03-17 04:51:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:47,297 INFO L225 Difference]: With dead ends: 34582 [2025-03-17 04:51:47,297 INFO L226 Difference]: Without dead ends: 30603 [2025-03-17 04:51:47,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 04:51:47,310 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 2839 mSDsluCounter, 6415 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 7277 SdHoareTripleChecker+Invalid, 3848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:47,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 7277 Invalid, 3848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3345 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 04:51:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30603 states. [2025-03-17 04:51:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30603 to 21622. [2025-03-17 04:51:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21622 states, 19348 states have (on average 1.520260492040521) internal successors, (29414), 19442 states have internal predecessors, (29414), 2101 states have call successors, (2101), 172 states have call predecessors, (2101), 172 states have return successors, (2101), 2007 states have call predecessors, (2101), 2101 states have call successors, (2101) [2025-03-17 04:51:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21622 states to 21622 states and 33616 transitions. [2025-03-17 04:51:49,049 INFO L78 Accepts]: Start accepts. Automaton has 21622 states and 33616 transitions. Word has length 591 [2025-03-17 04:51:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:49,051 INFO L471 AbstractCegarLoop]: Abstraction has 21622 states and 33616 transitions. [2025-03-17 04:51:49,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-17 04:51:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 21622 states and 33616 transitions. [2025-03-17 04:51:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-17 04:51:49,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:49,080 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:49,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:51:49,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:49,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash -88907084, now seen corresponding path program 1 times [2025-03-17 04:51:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:49,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234032885] [2025-03-17 04:51:49,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:49,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-17 04:51:49,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-17 04:51:49,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:49,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-17 04:51:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234032885] [2025-03-17 04:51:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234032885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:56,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:56,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-17 04:51:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564483663] [2025-03-17 04:51:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:56,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 04:51:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:56,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 04:51:56,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2025-03-17 04:51:56,014 INFO L87 Difference]: Start difference. First operand 21622 states and 33616 transitions. Second operand has 23 states, 23 states have (on average 6.478260869565218) internal successors, (149), 23 states have internal predecessors, (149), 4 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) [2025-03-17 04:52:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:52:32,141 INFO L93 Difference]: Finished difference Result 120017 states and 187997 transitions. [2025-03-17 04:52:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 04:52:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.478260869565218) internal successors, (149), 23 states have internal predecessors, (149), 4 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) Word has length 591 [2025-03-17 04:52:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:52:32,398 INFO L225 Difference]: With dead ends: 120017 [2025-03-17 04:52:32,398 INFO L226 Difference]: Without dead ends: 98555 [2025-03-17 04:52:32,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=447, Invalid=1715, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 04:52:32,456 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 13153 mSDsluCounter, 10667 mSDsCounter, 0 mSdLazyCounter, 10043 mSolverCounterSat, 2088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13153 SdHoareTripleChecker+Valid, 11664 SdHoareTripleChecker+Invalid, 12131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2088 IncrementalHoareTripleChecker+Valid, 10043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:52:32,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13153 Valid, 11664 Invalid, 12131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2088 Valid, 10043 Invalid, 0 Unknown, 0 Unchecked, 23.2s Time] [2025-03-17 04:52:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98555 states. [2025-03-17 04:52:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98555 to 27805. [2025-03-17 04:52:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27805 states, 24860 states have (on average 1.5253016894609814) internal successors, (37919), 24977 states have internal predecessors, (37919), 2723 states have call successors, (2723), 221 states have call predecessors, (2723), 221 states have return successors, (2723), 2606 states have call predecessors, (2723), 2723 states have call successors, (2723) [2025-03-17 04:52:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27805 states to 27805 states and 43365 transitions. [2025-03-17 04:52:35,215 INFO L78 Accepts]: Start accepts. Automaton has 27805 states and 43365 transitions. Word has length 591 [2025-03-17 04:52:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:52:35,216 INFO L471 AbstractCegarLoop]: Abstraction has 27805 states and 43365 transitions. [2025-03-17 04:52:35,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.478260869565218) internal successors, (149), 23 states have internal predecessors, (149), 4 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) [2025-03-17 04:52:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27805 states and 43365 transitions. [2025-03-17 04:52:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-17 04:52:35,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:52:35,248 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:35,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:52:35,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:52:35,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:52:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash -371138764, now seen corresponding path program 1 times [2025-03-17 04:52:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:52:35,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202276070] [2025-03-17 04:52:35,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:52:35,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-17 04:52:36,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-17 04:52:36,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:36,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat