./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-46.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 df69ef27b04a763c9eae25d4c49e492a4abf0cf87271d0ce91cfba82e7749765 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:33:14,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:33:14,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:33:14,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:33:14,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:33:14,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:33:14,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:33:14,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:33:14,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:33:14,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:33:14,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:33:14,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:33:14,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:33:14,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:33:14,494 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:33:14,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:33:14,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:33:14,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:33:14,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:33:14,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:33:14,496 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 -> df69ef27b04a763c9eae25d4c49e492a4abf0cf87271d0ce91cfba82e7749765 [2025-03-04 00:33:14,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:33:14,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:33:14,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:33:14,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:33:14,729 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:33:14,730 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-46.i [2025-03-04 00:33:15,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5facc2b18/153f762d094f404b80d57f65fd02eccc/FLAG62a391638 [2025-03-04 00:33:16,218 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:33:16,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-46.i [2025-03-04 00:33:16,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5facc2b18/153f762d094f404b80d57f65fd02eccc/FLAG62a391638 [2025-03-04 00:33:16,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5facc2b18/153f762d094f404b80d57f65fd02eccc [2025-03-04 00:33:16,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:33:16,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:33:16,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:33:16,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:33:16,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:33:16,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:16,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16, skipping insertion in model container [2025-03-04 00:33:16,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:16,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:33:16,584 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-46.i[916,929] [2025-03-04 00:33:16,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:33:16,826 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:33:16,833 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-46.i[916,929] [2025-03-04 00:33:16,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:33:16,957 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:33:16,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16 WrapperNode [2025-03-04 00:33:16,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:33:16,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:33:16,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:33:16,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:33:16,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:16,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,099 INFO L138 Inliner]: procedures = 26, calls = 88, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 740 [2025-03-04 00:33:17,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:33:17,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:33:17,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:33:17,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:33:17,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,194 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:33:17,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:33:17,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:33:17,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:33:17,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:33:17,280 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (1/1) ... [2025-03-04 00:33:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:33:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:17,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:33:17,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:33:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:33:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:33:17,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:33:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:33:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:33:17,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:33:17,444 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:33:17,445 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:33:18,425 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L648: havoc property_#t~bitwise50#1;havoc property_#t~short51#1;havoc property_#t~short52#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~bitwise53#1;havoc property_#t~short56#1;havoc property_#t~ite58#1;havoc property_#t~bitwise57#1;havoc property_#t~short59#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1; [2025-03-04 00:33:18,594 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-04 00:33:18,594 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:33:18,627 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:33:18,627 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:33:18,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:33:18 BoogieIcfgContainer [2025-03-04 00:33:18,628 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:33:18,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:33:18,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:33:18,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:33:18,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:33:16" (1/3) ... [2025-03-04 00:33:18,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9beafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:33:18, skipping insertion in model container [2025-03-04 00:33:18,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:16" (2/3) ... [2025-03-04 00:33:18,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9beafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:33:18, skipping insertion in model container [2025-03-04 00:33:18,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:33:18" (3/3) ... [2025-03-04 00:33:18,640 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-46.i [2025-03-04 00:33:18,651 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:33:18,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-46.i that has 2 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:33:18,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:33:18,722 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;@63c0745a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:33:18,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:33:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 221 states have internal predecessors, (336), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 00:33:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-04 00:33:18,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:18,752 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:18,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:18,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1569789373, now seen corresponding path program 1 times [2025-03-04 00:33:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:18,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997760909] [2025-03-04 00:33:18,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:18,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:18,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:33:18,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:33:18,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:18,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-03-04 00:33:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997760909] [2025-03-04 00:33:19,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997760909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:19,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739742470] [2025-03-04 00:33:19,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:19,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:19,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:19,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:19,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:33:19,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:33:19,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:33:19,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:19,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:19,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:33:19,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-03-04 00:33:19,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:33:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739742470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:33:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:33:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607598622] [2025-03-04 00:33:19,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:19,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:33:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:19,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:33:19,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:33:19,860 INFO L87 Difference]: Start difference. First operand has 298 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 221 states have internal predecessors, (336), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-04 00:33:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:19,931 INFO L93 Difference]: Finished difference Result 590 states and 1042 transitions. [2025-03-04 00:33:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:33:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) Word has length 520 [2025-03-04 00:33:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:19,943 INFO L225 Difference]: With dead ends: 590 [2025-03-04 00:33:19,944 INFO L226 Difference]: Without dead ends: 295 [2025-03-04 00:33:19,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:33:19,953 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:19,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:33:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-04 00:33:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-03-04 00:33:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.518348623853211) internal successors, (331), 218 states have internal predecessors, (331), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 00:33:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 481 transitions. [2025-03-04 00:33:20,021 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 481 transitions. Word has length 520 [2025-03-04 00:33:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:20,021 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 481 transitions. [2025-03-04 00:33:20,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-04 00:33:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 481 transitions. [2025-03-04 00:33:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-04 00:33:20,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:20,031 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:20,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:33:20,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:33:20,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:20,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash 933153576, now seen corresponding path program 1 times [2025-03-04 00:33:20,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:20,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77145328] [2025-03-04 00:33:20,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:20,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:33:20,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:33:20,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:20,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:20,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77145328] [2025-03-04 00:33:20,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77145328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:20,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:20,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215527996] [2025-03-04 00:33:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:20,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:20,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:20,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:20,719 INFO L87 Difference]: Start difference. First operand 295 states and 481 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:20,845 INFO L93 Difference]: Finished difference Result 879 states and 1437 transitions. [2025-03-04 00:33:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:33:20,846 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 520 [2025-03-04 00:33:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:20,853 INFO L225 Difference]: With dead ends: 879 [2025-03-04 00:33:20,853 INFO L226 Difference]: Without dead ends: 587 [2025-03-04 00:33:20,854 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-04 00:33:20,855 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 475 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:20,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 922 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:33:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-04 00:33:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2025-03-04 00:33:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 432 states have (on average 1.5185185185185186) internal successors, (656), 432 states have internal predecessors, (656), 150 states have call successors, (150), 2 states have call predecessors, (150), 2 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 00:33:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 956 transitions. [2025-03-04 00:33:20,952 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 956 transitions. Word has length 520 [2025-03-04 00:33:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:20,953 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 956 transitions. [2025-03-04 00:33:20,953 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 956 transitions. [2025-03-04 00:33:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-04 00:33:20,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:20,964 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:20,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:33:20,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:20,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -921191961, now seen corresponding path program 1 times [2025-03-04 00:33:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:20,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950459696] [2025-03-04 00:33:20,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:21,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:33:21,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:33:21,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:21,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950459696] [2025-03-04 00:33:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950459696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:22,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:22,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:22,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562017406] [2025-03-04 00:33:22,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:22,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:22,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:22,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:22,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:22,038 INFO L87 Difference]: Start difference. First operand 585 states and 956 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:22,456 INFO L93 Difference]: Finished difference Result 1754 states and 2871 transitions. [2025-03-04 00:33:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 520 [2025-03-04 00:33:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:22,467 INFO L225 Difference]: With dead ends: 1754 [2025-03-04 00:33:22,468 INFO L226 Difference]: Without dead ends: 1172 [2025-03-04 00:33:22,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:22,473 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 609 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:22,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1617 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:33:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-04 00:33:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 875. [2025-03-04 00:33:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 646 states have (on average 1.5170278637770898) internal successors, (980), 646 states have internal predecessors, (980), 225 states have call successors, (225), 3 states have call predecessors, (225), 3 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-04 00:33:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1430 transitions. [2025-03-04 00:33:22,571 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1430 transitions. Word has length 520 [2025-03-04 00:33:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:22,574 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1430 transitions. [2025-03-04 00:33:22,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1430 transitions. [2025-03-04 00:33:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 00:33:22,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:22,581 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:22,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:33:22,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash 524761697, now seen corresponding path program 1 times [2025-03-04 00:33:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660854083] [2025-03-04 00:33:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:22,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:22,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:22,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:22,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:23,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:23,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660854083] [2025-03-04 00:33:23,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660854083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:23,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:23,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:23,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101127214] [2025-03-04 00:33:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:23,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:23,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:23,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:23,439 INFO L87 Difference]: Start difference. First operand 875 states and 1430 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:23,864 INFO L93 Difference]: Finished difference Result 2900 states and 4744 transitions. [2025-03-04 00:33:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:23,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-03-04 00:33:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:23,878 INFO L225 Difference]: With dead ends: 2900 [2025-03-04 00:33:23,879 INFO L226 Difference]: Without dead ends: 2028 [2025-03-04 00:33:23,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:23,884 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 592 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:23,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1518 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:33:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2025-03-04 00:33:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1742. [2025-03-04 00:33:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1285 states have (on average 1.5058365758754864) internal successors, (1935), 1285 states have internal predecessors, (1935), 450 states have call successors, (450), 6 states have call predecessors, (450), 6 states have return successors, (450), 450 states have call predecessors, (450), 450 states have call successors, (450) [2025-03-04 00:33:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2835 transitions. [2025-03-04 00:33:24,045 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2835 transitions. Word has length 521 [2025-03-04 00:33:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:24,047 INFO L471 AbstractCegarLoop]: Abstraction has 1742 states and 2835 transitions. [2025-03-04 00:33:24,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2835 transitions. [2025-03-04 00:33:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 00:33:24,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:24,053 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:24,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:33:24,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:24,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1692957952, now seen corresponding path program 1 times [2025-03-04 00:33:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190887108] [2025-03-04 00:33:24,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:24,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:24,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:24,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:24,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:25,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:25,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190887108] [2025-03-04 00:33:25,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190887108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:25,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:25,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:25,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135491968] [2025-03-04 00:33:25,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:25,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:25,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:25,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:25,669 INFO L87 Difference]: Start difference. First operand 1742 states and 2835 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:26,249 INFO L93 Difference]: Finished difference Result 4145 states and 6726 transitions. [2025-03-04 00:33:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-03-04 00:33:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:26,268 INFO L225 Difference]: With dead ends: 4145 [2025-03-04 00:33:26,268 INFO L226 Difference]: Without dead ends: 2985 [2025-03-04 00:33:26,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:26,274 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 909 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:26,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1236 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:33:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2025-03-04 00:33:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2656. [2025-03-04 00:33:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2043 states have (on average 1.5198237885462555) internal successors, (3105), 2047 states have internal predecessors, (3105), 602 states have call successors, (602), 10 states have call predecessors, (602), 10 states have return successors, (602), 598 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-04 00:33:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 4309 transitions. [2025-03-04 00:33:26,483 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 4309 transitions. Word has length 521 [2025-03-04 00:33:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:26,484 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 4309 transitions. [2025-03-04 00:33:26,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 4309 transitions. [2025-03-04 00:33:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 00:33:26,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:26,489 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:26,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:33:26,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:26,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1028929695, now seen corresponding path program 1 times [2025-03-04 00:33:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:26,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97229720] [2025-03-04 00:33:26,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:26,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:26,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:26,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:26,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:26,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:26,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:26,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97229720] [2025-03-04 00:33:26,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97229720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:26,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:26,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:26,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507660023] [2025-03-04 00:33:26,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:26,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:26,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:26,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:26,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:26,670 INFO L87 Difference]: Start difference. First operand 2656 states and 4309 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:26,848 INFO L93 Difference]: Finished difference Result 4734 states and 7679 transitions. [2025-03-04 00:33:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:33:26,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-03-04 00:33:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:26,864 INFO L225 Difference]: With dead ends: 4734 [2025-03-04 00:33:26,864 INFO L226 Difference]: Without dead ends: 2660 [2025-03-04 00:33:26,868 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-04 00:33:26,869 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 454 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:26,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1171 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:33:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-03-04 00:33:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2658. [2025-03-04 00:33:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2045 states have (on average 1.5144254278728606) internal successors, (3097), 2049 states have internal predecessors, (3097), 602 states have call successors, (602), 10 states have call predecessors, (602), 10 states have return successors, (602), 598 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-04 00:33:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4301 transitions. [2025-03-04 00:33:27,018 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4301 transitions. Word has length 521 [2025-03-04 00:33:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:27,018 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 4301 transitions. [2025-03-04 00:33:27,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4301 transitions. [2025-03-04 00:33:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 00:33:27,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:27,023 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:27,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:33:27,023 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:27,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash 656159905, now seen corresponding path program 1 times [2025-03-04 00:33:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:27,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49871809] [2025-03-04 00:33:27,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:27,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:27,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:27,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:27,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:27,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:27,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:27,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49871809] [2025-03-04 00:33:27,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49871809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:27,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:27,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860601800] [2025-03-04 00:33:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:27,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:27,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:27,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:27,985 INFO L87 Difference]: Start difference. First operand 2658 states and 4301 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:28,567 INFO L93 Difference]: Finished difference Result 6639 states and 10731 transitions. [2025-03-04 00:33:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:28,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-03-04 00:33:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:28,591 INFO L225 Difference]: With dead ends: 6639 [2025-03-04 00:33:28,591 INFO L226 Difference]: Without dead ends: 3984 [2025-03-04 00:33:28,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:28,601 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 295 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:28,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1175 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:33:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2025-03-04 00:33:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3976. [2025-03-04 00:33:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3976 states, 3057 states have (on average 1.5060516846581615) internal successors, (4604), 3063 states have internal predecessors, (4604), 903 states have call successors, (903), 15 states have call predecessors, (903), 15 states have return successors, (903), 897 states have call predecessors, (903), 903 states have call successors, (903) [2025-03-04 00:33:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 6410 transitions. [2025-03-04 00:33:28,834 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 6410 transitions. Word has length 521 [2025-03-04 00:33:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 3976 states and 6410 transitions. [2025-03-04 00:33:28,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 6410 transitions. [2025-03-04 00:33:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 00:33:28,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:28,841 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:28,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:33:28,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:28,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2119792127, now seen corresponding path program 1 times [2025-03-04 00:33:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777030578] [2025-03-04 00:33:28,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:28,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:29,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:29,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:29,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777030578] [2025-03-04 00:33:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777030578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049869261] [2025-03-04 00:33:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:29,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:29,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:29,820 INFO L87 Difference]: Start difference. First operand 3976 states and 6410 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:30,623 INFO L93 Difference]: Finished difference Result 15480 states and 24869 transitions. [2025-03-04 00:33:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:30,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-03-04 00:33:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:30,696 INFO L225 Difference]: With dead ends: 15480 [2025-03-04 00:33:30,696 INFO L226 Difference]: Without dead ends: 11507 [2025-03-04 00:33:30,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:30,713 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1201 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:30,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 2323 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:33:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11507 states. [2025-03-04 00:33:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11507 to 5950. [2025-03-04 00:33:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5950 states, 4914 states have (on average 1.5417175417175417) internal successors, (7576), 4923 states have internal predecessors, (7576), 1017 states have call successors, (1017), 18 states have call predecessors, (1017), 18 states have return successors, (1017), 1008 states have call predecessors, (1017), 1017 states have call successors, (1017) [2025-03-04 00:33:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 9610 transitions. [2025-03-04 00:33:31,169 INFO L78 Accepts]: Start accepts. Automaton has 5950 states and 9610 transitions. Word has length 521 [2025-03-04 00:33:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:31,171 INFO L471 AbstractCegarLoop]: Abstraction has 5950 states and 9610 transitions. [2025-03-04 00:33:31,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5950 states and 9610 transitions. [2025-03-04 00:33:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 00:33:31,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:31,179 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:31,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:33:31,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:31,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1308122944, now seen corresponding path program 1 times [2025-03-04 00:33:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:31,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278748260] [2025-03-04 00:33:31,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:31,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:31,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:31,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:31,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278748260] [2025-03-04 00:33:32,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278748260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:32,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086707220] [2025-03-04 00:33:32,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:32,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:32,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:32,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:32,084 INFO L87 Difference]: Start difference. First operand 5950 states and 9610 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:32,901 INFO L93 Difference]: Finished difference Result 21214 states and 34239 transitions. [2025-03-04 00:33:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:32,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-03-04 00:33:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:32,948 INFO L225 Difference]: With dead ends: 21214 [2025-03-04 00:33:32,949 INFO L226 Difference]: Without dead ends: 15267 [2025-03-04 00:33:32,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:32,967 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 756 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:32,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1215 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:33:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15267 states. [2025-03-04 00:33:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15267 to 12131. [2025-03-04 00:33:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12131 states, 10429 states have (on average 1.538114871991562) internal successors, (16041), 10456 states have internal predecessors, (16041), 1665 states have call successors, (1665), 36 states have call predecessors, (1665), 36 states have return successors, (1665), 1638 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-03-04 00:33:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12131 states to 12131 states and 19371 transitions. [2025-03-04 00:33:33,624 INFO L78 Accepts]: Start accepts. Automaton has 12131 states and 19371 transitions. Word has length 521 [2025-03-04 00:33:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:33,626 INFO L471 AbstractCegarLoop]: Abstraction has 12131 states and 19371 transitions. [2025-03-04 00:33:33,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12131 states and 19371 transitions. [2025-03-04 00:33:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 00:33:33,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:33,645 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:33,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:33:33,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:33,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2064160769, now seen corresponding path program 1 times [2025-03-04 00:33:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:33,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915773674] [2025-03-04 00:33:33,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:34,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:34,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:34,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:34,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:34,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915773674] [2025-03-04 00:33:34,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915773674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:34,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:34,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:34,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284889195] [2025-03-04 00:33:34,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:34,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:34,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:34,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:34,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:34,838 INFO L87 Difference]: Start difference. First operand 12131 states and 19371 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:35,798 INFO L93 Difference]: Finished difference Result 29984 states and 47897 transitions. [2025-03-04 00:33:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:35,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-03-04 00:33:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:35,850 INFO L225 Difference]: With dead ends: 29984 [2025-03-04 00:33:35,851 INFO L226 Difference]: Without dead ends: 17856 [2025-03-04 00:33:35,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:35,874 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 601 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:35,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1615 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:33:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17856 states. [2025-03-04 00:33:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17856 to 13193. [2025-03-04 00:33:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13193 states, 11491 states have (on average 1.5418153337394482) internal successors, (17717), 11518 states have internal predecessors, (17717), 1665 states have call successors, (1665), 36 states have call predecessors, (1665), 36 states have return successors, (1665), 1638 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-03-04 00:33:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13193 states to 13193 states and 21047 transitions. [2025-03-04 00:33:36,410 INFO L78 Accepts]: Start accepts. Automaton has 13193 states and 21047 transitions. Word has length 521 [2025-03-04 00:33:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:36,411 INFO L471 AbstractCegarLoop]: Abstraction has 13193 states and 21047 transitions. [2025-03-04 00:33:36,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:33:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13193 states and 21047 transitions. [2025-03-04 00:33:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 00:33:36,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:36,425 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:36,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:33:36,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:36,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash -119516158, now seen corresponding path program 1 times [2025-03-04 00:33:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198212676] [2025-03-04 00:33:36,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:36,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:38,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:38,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:38,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-04 00:33:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198212676] [2025-03-04 00:33:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198212676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215390152] [2025-03-04 00:33:38,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:38,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:38,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:38,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:38,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:33:39,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 00:33:39,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 00:33:39,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:39,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:39,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:33:39,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 3984 proven. 171 refuted. 0 times theorem prover too weak. 6945 trivial. 0 not checked. [2025-03-04 00:33:39,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 51 proven. 171 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-04 00:33:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215390152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:40,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:40,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 00:33:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961813418] [2025-03-04 00:33:40,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:40,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:33:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:40,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:33:40,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:33:40,289 INFO L87 Difference]: Start difference. First operand 13193 states and 21047 transitions. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) [2025-03-04 00:33:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:41,168 INFO L93 Difference]: Finished difference Result 26743 states and 42379 transitions. [2025-03-04 00:33:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:33:41,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) Word has length 521 [2025-03-04 00:33:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:41,208 INFO L225 Difference]: With dead ends: 26743 [2025-03-04 00:33:41,208 INFO L226 Difference]: Without dead ends: 13553 [2025-03-04 00:33:41,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:33:41,223 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 827 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:41,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 938 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:33:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2025-03-04 00:33:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 13481. [2025-03-04 00:33:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13481 states, 11707 states have (on average 1.5149056120269924) internal successors, (17735), 11734 states have internal predecessors, (17735), 1665 states have call successors, (1665), 108 states have call predecessors, (1665), 108 states have return successors, (1665), 1638 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-03-04 00:33:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 21065 transitions. [2025-03-04 00:33:42,036 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 21065 transitions. Word has length 521 [2025-03-04 00:33:42,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:42,037 INFO L471 AbstractCegarLoop]: Abstraction has 13481 states and 21065 transitions. [2025-03-04 00:33:42,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) [2025-03-04 00:33:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 21065 transitions. [2025-03-04 00:33:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-04 00:33:42,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:42,052 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:42,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:33:42,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 00:33:42,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:42,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash 807092037, now seen corresponding path program 1 times [2025-03-04 00:33:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:42,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613199176] [2025-03-04 00:33:42,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:42,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:42,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-04 00:33:43,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-04 00:33:43,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:43,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:52,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:52,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613199176] [2025-03-04 00:33:52,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613199176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:52,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:52,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:33:52,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035194256] [2025-03-04 00:33:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:52,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:33:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:52,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:33:52,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:33:52,640 INFO L87 Difference]: Start difference. First operand 13481 states and 21065 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 4 states have call predecessors, (75), 4 states have call successors, (75) [2025-03-04 00:33:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:55,981 INFO L93 Difference]: Finished difference Result 58086 states and 90520 transitions. [2025-03-04 00:33:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:33:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 4 states have call predecessors, (75), 4 states have call successors, (75) Word has length 523 [2025-03-04 00:33:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:56,105 INFO L225 Difference]: With dead ends: 58086 [2025-03-04 00:33:56,106 INFO L226 Difference]: Without dead ends: 44608 [2025-03-04 00:33:56,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:33:56,134 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 1590 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:56,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 3871 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 00:33:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44608 states. [2025-03-04 00:33:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44608 to 43160. [2025-03-04 00:33:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43160 states, 38281 states have (on average 1.515973981870902) internal successors, (58033), 38371 states have internal predecessors, (58033), 4554 states have call successors, (4554), 324 states have call predecessors, (4554), 324 states have return successors, (4554), 4464 states have call predecessors, (4554), 4554 states have call successors, (4554) [2025-03-04 00:33:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43160 states to 43160 states and 67141 transitions. [2025-03-04 00:33:58,498 INFO L78 Accepts]: Start accepts. Automaton has 43160 states and 67141 transitions. Word has length 523 [2025-03-04 00:33:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:58,499 INFO L471 AbstractCegarLoop]: Abstraction has 43160 states and 67141 transitions. [2025-03-04 00:33:58,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 4 states have call predecessors, (75), 4 states have call successors, (75) [2025-03-04 00:33:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 43160 states and 67141 transitions. [2025-03-04 00:33:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-04 00:33:58,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:58,532 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:58,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:33:58,533 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:58,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1993962810, now seen corresponding path program 1 times [2025-03-04 00:33:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:58,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928819616] [2025-03-04 00:33:58,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:58,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-04 00:33:58,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-04 00:33:58,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:58,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-04 00:33:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928819616] [2025-03-04 00:33:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928819616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:59,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:59,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509596456] [2025-03-04 00:33:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:59,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:59,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:59,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:59,025 INFO L87 Difference]: Start difference. First operand 43160 states and 67141 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:34:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:01,870 INFO L93 Difference]: Finished difference Result 114598 states and 178462 transitions. [2025-03-04 00:34:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:34:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 523 [2025-03-04 00:34:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:02,094 INFO L225 Difference]: With dead ends: 114598 [2025-03-04 00:34:02,095 INFO L226 Difference]: Without dead ends: 71441 [2025-03-04 00:34:02,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:34:02,173 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 323 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:02,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1121 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:34:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71441 states. [2025-03-04 00:34:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71441 to 71439. [2025-03-04 00:34:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71439 states, 62977 states have (on average 1.5120282007717103) internal successors, (95223), 63122 states have internal predecessors, (95223), 7918 states have call successors, (7918), 543 states have call predecessors, (7918), 543 states have return successors, (7918), 7773 states have call predecessors, (7918), 7918 states have call successors, (7918) [2025-03-04 00:34:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71439 states to 71439 states and 111059 transitions. [2025-03-04 00:34:05,474 INFO L78 Accepts]: Start accepts. Automaton has 71439 states and 111059 transitions. Word has length 523 [2025-03-04 00:34:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 71439 states and 111059 transitions. [2025-03-04 00:34:05,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-04 00:34:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 71439 states and 111059 transitions. [2025-03-04 00:34:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-03-04 00:34:05,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:05,502 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:34:05,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:34:05,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:05,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1605565154, now seen corresponding path program 1 times [2025-03-04 00:34:05,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:05,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756057653] [2025-03-04 00:34:05,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:05,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-04 00:34:08,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-04 00:34:08,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:08,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 57 proven. 165 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-04 00:34:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756057653] [2025-03-04 00:34:08,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756057653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316734676] [2025-03-04 00:34:08,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:08,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:08,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:34:08,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:34:08,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-04 00:34:09,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-04 00:34:09,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:09,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:09,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:34:09,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:34:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 4292 proven. 165 refuted. 0 times theorem prover too weak. 6643 trivial. 0 not checked. [2025-03-04 00:34:09,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:34:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 57 proven. 165 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-04 00:34:09,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316734676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:34:09,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:34:09,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 00:34:09,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923134358] [2025-03-04 00:34:09,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:34:09,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:34:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:09,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:34:09,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:34:09,698 INFO L87 Difference]: Start difference. First operand 71439 states and 111059 transitions. Second operand has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 4 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 4 states have call predecessors, (187), 4 states have call successors, (187) [2025-03-04 00:34:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:12,694 INFO L93 Difference]: Finished difference Result 143820 states and 222848 transitions. [2025-03-04 00:34:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:34:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 4 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 4 states have call predecessors, (187), 4 states have call successors, (187) Word has length 524 [2025-03-04 00:34:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:12,879 INFO L225 Difference]: With dead ends: 143820 [2025-03-04 00:34:12,880 INFO L226 Difference]: Without dead ends: 72451 [2025-03-04 00:34:12,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:34:12,983 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 294 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:12,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 982 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:34:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72451 states. [2025-03-04 00:34:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72451 to 72163. [2025-03-04 00:34:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72163 states, 63520 states have (on average 1.50647040302267) internal successors, (95691), 63665 states have internal predecessors, (95691), 7918 states have call successors, (7918), 724 states have call predecessors, (7918), 724 states have return successors, (7918), 7773 states have call predecessors, (7918), 7918 states have call successors, (7918) [2025-03-04 00:34:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72163 states to 72163 states and 111527 transitions. [2025-03-04 00:34:16,223 INFO L78 Accepts]: Start accepts. Automaton has 72163 states and 111527 transitions. Word has length 524 [2025-03-04 00:34:16,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:16,224 INFO L471 AbstractCegarLoop]: Abstraction has 72163 states and 111527 transitions. [2025-03-04 00:34:16,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 4 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 4 states have call predecessors, (187), 4 states have call successors, (187) [2025-03-04 00:34:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 72163 states and 111527 transitions. [2025-03-04 00:34:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-03-04 00:34:16,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:16,247 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:34:16,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:34:16,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:16,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:16,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash -397646979, now seen corresponding path program 1 times [2025-03-04 00:34:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:16,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054265930] [2025-03-04 00:34:16,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:16,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-04 00:34:18,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-04 00:34:18,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:18,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-04 00:34:24,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:24,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054265930] [2025-03-04 00:34:24,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054265930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:24,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38988552] [2025-03-04 00:34:24,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:24,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:24,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:24,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:34:24,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:34:24,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-04 00:34:24,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-04 00:34:24,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:24,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:24,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:34:24,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:34:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 5622 proven. 108 refuted. 0 times theorem prover too weak. 5370 trivial. 0 not checked. [2025-03-04 00:34:24,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:34:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 114 proven. 108 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-04 00:34:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38988552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:34:25,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:34:25,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5] total 19 [2025-03-04 00:34:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508171759] [2025-03-04 00:34:25,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:34:25,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:34:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:25,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:34:25,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:34:25,304 INFO L87 Difference]: Start difference. First operand 72163 states and 111527 transitions. Second operand has 19 states, 19 states have (on average 15.31578947368421) internal successors, (291), 19 states have internal predecessors, (291), 7 states have call successors, (186), 2 states have call predecessors, (186), 4 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187)