./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.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_loopvsstraightlinecode_100-1loop_file-68.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 7af22c4985483bd6c8caf866cf1f41c10246f5959d956f77eec260fff7ae1f47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:49:32,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:49:32,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:49:32,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:49:32,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:49:32,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:49:32,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:49:32,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:49:32,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:49:32,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:49:32,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:49:32,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:49:32,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:49:32,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:49:32,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:49:32,850 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:49:32,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:49:32,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:49:32,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:49:32,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:49:32,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:49:32,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:49:32,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:49:32,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:49:32,852 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 -> 7af22c4985483bd6c8caf866cf1f41c10246f5959d956f77eec260fff7ae1f47 [2025-03-03 22:49:33,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:49:33,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:49:33,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:49:33,088 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:49:33,088 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:49:33,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-03-03 22:49:34,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9305ea46/743d75a7815542648962865c70a1b865/FLAGb205b2e4f [2025-03-03 22:49:34,436 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:49:34,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-03-03 22:49:34,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9305ea46/743d75a7815542648962865c70a1b865/FLAGb205b2e4f [2025-03-03 22:49:34,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9305ea46/743d75a7815542648962865c70a1b865 [2025-03-03 22:49:34,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:49:34,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:49:34,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:49:34,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:49:34,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:49:34,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216d678a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34, skipping insertion in model container [2025-03-03 22:49:34,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:49:34,575 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_loopvsstraightlinecode_100-1loop_file-68.i[916,929] [2025-03-03 22:49:34,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:49:34,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:49:34,683 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_loopvsstraightlinecode_100-1loop_file-68.i[916,929] [2025-03-03 22:49:34,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:49:34,749 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:49:34,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34 WrapperNode [2025-03-03 22:49:34,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:49:34,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:49:34,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:49:34,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:49:34,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,797 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 392 [2025-03-03 22:49:34,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:49:34,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:49:34,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:49:34,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:49:34,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,833 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-03 22:49:34,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,847 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:49:34,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:49:34,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:49:34,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:49:34,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (1/1) ... [2025-03-03 22:49:34,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:49:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:49:34,890 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-03 22:49:34,892 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-03 22:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:49:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:49:34,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:49:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:49:34,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:49:34,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:49:34,988 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:49:34,990 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:49:35,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-03-03 22:49:35,510 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-03 22:49:35,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:49:35,536 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:49:35,538 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:49:35,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:35 BoogieIcfgContainer [2025-03-03 22:49:35,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:49:35,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:49:35,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:49:35,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:49:35,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:49:34" (1/3) ... [2025-03-03 22:49:35,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129fef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:35, skipping insertion in model container [2025-03-03 22:49:35,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:34" (2/3) ... [2025-03-03 22:49:35,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129fef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:35, skipping insertion in model container [2025-03-03 22:49:35,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:35" (3/3) ... [2025-03-03 22:49:35,547 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-03-03 22:49:35,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:49:35,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-68.i that has 2 procedures, 162 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:49:35,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:49:35,629 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;@54718f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:49:35,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:49:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:49:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-03 22:49:35,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:35,667 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:35,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2112434822, now seen corresponding path program 1 times [2025-03-03 22:49:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397582006] [2025-03-03 22:49:35,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:35,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 22:49:35,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 22:49:35,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:35,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-03 22:49:36,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:36,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397582006] [2025-03-03 22:49:36,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397582006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:49:36,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380188946] [2025-03-03 22:49:36,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:36,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:49:36,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:49:36,021 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-03 22:49:36,022 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-03 22:49:36,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 22:49:36,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 22:49:36,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:36,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:36,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:49:36,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:49:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-03 22:49:36,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:49:36,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380188946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:49:36,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:49:36,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:49:36,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880510679] [2025-03-03 22:49:36,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:49:36,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:49:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:36,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:49:36,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:49:36,243 INFO L87 Difference]: Start difference. First operand has 162 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 22:49:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:36,298 INFO L93 Difference]: Finished difference Result 321 states and 543 transitions. [2025-03-03 22:49:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:49:36,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 269 [2025-03-03 22:49:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:36,305 INFO L225 Difference]: With dead ends: 321 [2025-03-03 22:49:36,305 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 22:49:36,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 270 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-03 22:49:36,314 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:36,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:49:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 22:49:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-03 22:49:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 117 states have (on average 1.435897435897436) internal successors, (168), 117 states have internal predecessors, (168), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:49:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2025-03-03 22:49:36,357 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 269 [2025-03-03 22:49:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:36,360 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2025-03-03 22:49:36,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 22:49:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2025-03-03 22:49:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-03 22:49:36,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:36,364 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:36,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:49:36,565 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-03 22:49:36,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:36,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2079483428, now seen corresponding path program 1 times [2025-03-03 22:49:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:36,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857155274] [2025-03-03 22:49:36,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:36,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:36,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 22:49:36,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 22:49:36,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:36,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:49:38,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:38,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857155274] [2025-03-03 22:49:38,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857155274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:49:38,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:49:38,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:49:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598848531] [2025-03-03 22:49:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:49:38,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:49:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:38,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:49:38,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:49:38,740 INFO L87 Difference]: Start difference. First operand 159 states and 248 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:49:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:39,864 INFO L93 Difference]: Finished difference Result 633 states and 980 transitions. [2025-03-03 22:49:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:49:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 269 [2025-03-03 22:49:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:39,869 INFO L225 Difference]: With dead ends: 633 [2025-03-03 22:49:39,872 INFO L226 Difference]: Without dead ends: 477 [2025-03-03 22:49:39,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:49:39,874 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 564 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:39,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 931 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:49:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-03 22:49:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 450. [2025-03-03 22:49:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 363 states have (on average 1.4710743801652892) internal successors, (534), 364 states have internal predecessors, (534), 83 states have call successors, (83), 3 states have call predecessors, (83), 3 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-03 22:49:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 700 transitions. [2025-03-03 22:49:39,926 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 700 transitions. Word has length 269 [2025-03-03 22:49:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:39,927 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 700 transitions. [2025-03-03 22:49:39,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:49:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 700 transitions. [2025-03-03 22:49:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-03 22:49:39,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:39,932 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:39,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:49:39,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:39,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash -862174171, now seen corresponding path program 1 times [2025-03-03 22:49:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299883202] [2025-03-03 22:49:39,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:39,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 22:49:40,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 22:49:40,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:40,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:49:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:40,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299883202] [2025-03-03 22:49:40,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299883202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:49:40,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291213364] [2025-03-03 22:49:40,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:40,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:49:40,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:49:40,317 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-03 22:49:40,319 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-03 22:49:40,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 22:49:40,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 22:49:40,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:40,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:40,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 22:49:40,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:49:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1509 proven. 72 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2025-03-03 22:49:40,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:49:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:49:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291213364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:49:41,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:49:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-03-03 22:49:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794906002] [2025-03-03 22:49:41,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:49:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:49:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:41,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:49:41,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:49:41,114 INFO L87 Difference]: Start difference. First operand 450 states and 700 transitions. Second operand has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) [2025-03-03 22:49:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:42,046 INFO L93 Difference]: Finished difference Result 1181 states and 1815 transitions. [2025-03-03 22:49:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 22:49:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) Word has length 269 [2025-03-03 22:49:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:42,052 INFO L225 Difference]: With dead ends: 1181 [2025-03-03 22:49:42,053 INFO L226 Difference]: Without dead ends: 734 [2025-03-03 22:49:42,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=537, Unknown=0, NotChecked=0, Total=756 [2025-03-03 22:49:42,055 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 429 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:42,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 958 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:49:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-03 22:49:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 722. [2025-03-03 22:49:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 597 states have (on average 1.390284757118928) internal successors, (830), 601 states have internal predecessors, (830), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 22:49:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1054 transitions. [2025-03-03 22:49:42,108 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1054 transitions. Word has length 269 [2025-03-03 22:49:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:42,109 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1054 transitions. [2025-03-03 22:49:42,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) [2025-03-03 22:49:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1054 transitions. [2025-03-03 22:49:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 22:49:42,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:42,112 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:42,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:49:42,313 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,SelfDestructingSolverStorable2 [2025-03-03 22:49:42,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:42,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1844445113, now seen corresponding path program 1 times [2025-03-03 22:49:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:42,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492079380] [2025-03-03 22:49:42,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:42,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 22:49:42,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 22:49:42,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:42,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:49:42,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:42,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492079380] [2025-03-03 22:49:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492079380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:49:42,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:49:42,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:49:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317618800] [2025-03-03 22:49:42,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:49:42,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:49:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:42,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:49:42,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:49:42,542 INFO L87 Difference]: Start difference. First operand 722 states and 1054 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:49:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:42,646 INFO L93 Difference]: Finished difference Result 2158 states and 3154 transitions. [2025-03-03 22:49:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:49:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 270 [2025-03-03 22:49:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:42,655 INFO L225 Difference]: With dead ends: 2158 [2025-03-03 22:49:42,655 INFO L226 Difference]: Without dead ends: 1439 [2025-03-03 22:49:42,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:49:42,658 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 157 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:42,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 514 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:49:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-03 22:49:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2025-03-03 22:49:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1188 states have (on average 1.3821548821548821) internal successors, (1642), 1196 states have internal predecessors, (1642), 224 states have call successors, (224), 24 states have call predecessors, (224), 24 states have return successors, (224), 216 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 22:49:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2090 transitions. [2025-03-03 22:49:42,778 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2090 transitions. Word has length 270 [2025-03-03 22:49:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:42,779 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2090 transitions. [2025-03-03 22:49:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:49:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2090 transitions. [2025-03-03 22:49:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 22:49:42,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:42,784 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:42,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:49:42,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:42,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash -15249832, now seen corresponding path program 1 times [2025-03-03 22:49:42,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:42,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59911571] [2025-03-03 22:49:42,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:42,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 22:49:42,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 22:49:42,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:42,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:49:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59911571] [2025-03-03 22:49:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59911571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:49:45,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:49:45,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 22:49:45,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588299431] [2025-03-03 22:49:45,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:49:45,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:49:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:45,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:49:45,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:49:45,021 INFO L87 Difference]: Start difference. First operand 1437 states and 2090 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:49:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:47,060 INFO L93 Difference]: Finished difference Result 3936 states and 5648 transitions. [2025-03-03 22:49:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:49:47,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 271 [2025-03-03 22:49:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:47,077 INFO L225 Difference]: With dead ends: 3936 [2025-03-03 22:49:47,080 INFO L226 Difference]: Without dead ends: 2502 [2025-03-03 22:49:47,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-03-03 22:49:47,085 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1928 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:47,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 1249 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 22:49:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2025-03-03 22:49:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1865. [2025-03-03 22:49:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1496 states have (on average 1.356951871657754) internal successors, (2030), 1508 states have internal predecessors, (2030), 330 states have call successors, (330), 38 states have call predecessors, (330), 38 states have return successors, (330), 318 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-03 22:49:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2690 transitions. [2025-03-03 22:49:47,222 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2690 transitions. Word has length 271 [2025-03-03 22:49:47,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:47,222 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2690 transitions. [2025-03-03 22:49:47,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:49:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2690 transitions. [2025-03-03 22:49:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 22:49:47,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:47,226 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:47,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:49:47,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:47,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1492301977, now seen corresponding path program 1 times [2025-03-03 22:49:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:47,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452128456] [2025-03-03 22:49:47,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:47,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 22:49:47,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 22:49:47,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:47,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:49:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452128456] [2025-03-03 22:49:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452128456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:49:48,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:49:48,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:49:48,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880483767] [2025-03-03 22:49:48,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:49:48,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:49:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:48,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:49:48,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:49:48,942 INFO L87 Difference]: Start difference. First operand 1865 states and 2690 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 22:49:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:50,147 INFO L93 Difference]: Finished difference Result 4244 states and 6101 transitions. [2025-03-03 22:49:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 22:49:50,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 271 [2025-03-03 22:49:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:50,161 INFO L225 Difference]: With dead ends: 4244 [2025-03-03 22:49:50,161 INFO L226 Difference]: Without dead ends: 2358 [2025-03-03 22:49:50,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:49:50,167 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 842 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:50,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1175 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:49:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2025-03-03 22:49:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 1857. [2025-03-03 22:49:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1488 states have (on average 1.3588709677419355) internal successors, (2022), 1500 states have internal predecessors, (2022), 330 states have call successors, (330), 38 states have call predecessors, (330), 38 states have return successors, (330), 318 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-03 22:49:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2682 transitions. [2025-03-03 22:49:50,279 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2682 transitions. Word has length 271 [2025-03-03 22:49:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:50,280 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2682 transitions. [2025-03-03 22:49:50,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 22:49:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2682 transitions. [2025-03-03 22:49:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 22:49:50,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:50,297 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:50,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:49:50,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:50,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1338059865, now seen corresponding path program 1 times [2025-03-03 22:49:50,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:50,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407453928] [2025-03-03 22:49:50,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:50,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:50,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 22:49:50,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 22:49:50,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:50,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:49:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407453928] [2025-03-03 22:49:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407453928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:49:55,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:49:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 22:49:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646826460] [2025-03-03 22:49:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:49:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:49:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:55,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:49:55,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:49:55,778 INFO L87 Difference]: Start difference. First operand 1857 states and 2682 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 22:49:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:59,144 INFO L93 Difference]: Finished difference Result 6630 states and 9438 transitions. [2025-03-03 22:49:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:49:59,145 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 271 [2025-03-03 22:49:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:59,165 INFO L225 Difference]: With dead ends: 6630 [2025-03-03 22:49:59,165 INFO L226 Difference]: Without dead ends: 4776 [2025-03-03 22:49:59,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2025-03-03 22:49:59,171 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1860 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:59,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 1865 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 22:49:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2025-03-03 22:49:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 3516. [2025-03-03 22:49:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 2935 states have (on average 1.3706984667802384) internal successors, (4023), 2959 states have internal predecessors, (4023), 514 states have call successors, (514), 66 states have call predecessors, (514), 66 states have return successors, (514), 490 states have call predecessors, (514), 514 states have call successors, (514) [2025-03-03 22:49:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 5051 transitions. [2025-03-03 22:49:59,383 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 5051 transitions. Word has length 271 [2025-03-03 22:49:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:59,383 INFO L471 AbstractCegarLoop]: Abstraction has 3516 states and 5051 transitions. [2025-03-03 22:49:59,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 22:49:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 5051 transitions. [2025-03-03 22:49:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 22:49:59,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:59,389 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:59,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:49:59,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:59,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1449355622, now seen corresponding path program 1 times [2025-03-03 22:49:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:59,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541603037] [2025-03-03 22:49:59,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:59,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 22:49:59,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 22:49:59,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:59,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 36 proven. 81 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:50:00,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:00,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541603037] [2025-03-03 22:50:00,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541603037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:00,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966562297] [2025-03-03 22:50:00,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:00,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:00,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:00,014 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-03 22:50:00,016 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-03 22:50:00,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 22:50:00,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 22:50:00,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:00,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:00,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 22:50:00,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1190 proven. 48 refuted. 0 times theorem prover too weak. 1882 trivial. 0 not checked. [2025-03-03 22:50:00,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:50:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:50:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966562297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:50:00,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:50:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 20 [2025-03-03 22:50:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095663317] [2025-03-03 22:50:00,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:50:00,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 22:50:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:00,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 22:50:00,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:50:00,589 INFO L87 Difference]: Start difference. First operand 3516 states and 5051 transitions. Second operand has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 4 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2025-03-03 22:50:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:04,008 INFO L93 Difference]: Finished difference Result 14003 states and 19544 transitions. [2025-03-03 22:50:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-03-03 22:50:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 4 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) Word has length 271 [2025-03-03 22:50:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:04,051 INFO L225 Difference]: With dead ends: 14003 [2025-03-03 22:50:04,051 INFO L226 Difference]: Without dead ends: 10490 [2025-03-03 22:50:04,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 549 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3926 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2006, Invalid=8094, Unknown=0, NotChecked=0, Total=10100 [2025-03-03 22:50:04,064 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 2584 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 938 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 938 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:04,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 1692 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [938 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 22:50:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2025-03-03 22:50:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 4234. [2025-03-03 22:50:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4234 states, 3544 states have (on average 1.3589164785553047) internal successors, (4816), 3569 states have internal predecessors, (4816), 554 states have call successors, (554), 135 states have call predecessors, (554), 135 states have return successors, (554), 529 states have call predecessors, (554), 554 states have call successors, (554) [2025-03-03 22:50:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 5924 transitions. [2025-03-03 22:50:04,440 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 5924 transitions. Word has length 271 [2025-03-03 22:50:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:04,441 INFO L471 AbstractCegarLoop]: Abstraction has 4234 states and 5924 transitions. [2025-03-03 22:50:04,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 4 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2025-03-03 22:50:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 5924 transitions. [2025-03-03 22:50:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 22:50:04,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:04,446 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:04,454 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-03 22:50:04,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:04,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:04,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -522189598, now seen corresponding path program 1 times [2025-03-03 22:50:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:04,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746844888] [2025-03-03 22:50:04,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:04,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:04,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 22:50:04,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 22:50:04,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:04,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:50:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746844888] [2025-03-03 22:50:05,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746844888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:05,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:05,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:50:05,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633143159] [2025-03-03 22:50:05,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:05,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:50:05,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:05,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:50:05,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:50:05,047 INFO L87 Difference]: Start difference. First operand 4234 states and 5924 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:05,711 INFO L93 Difference]: Finished difference Result 11810 states and 16470 transitions. [2025-03-03 22:50:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:50:05,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 272 [2025-03-03 22:50:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:05,740 INFO L225 Difference]: With dead ends: 11810 [2025-03-03 22:50:05,741 INFO L226 Difference]: Without dead ends: 7658 [2025-03-03 22:50:05,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:50:05,746 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 270 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:05,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 678 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:50:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2025-03-03 22:50:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 6601. [2025-03-03 22:50:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 5473 states have (on average 1.355746391375845) internal successors, (7420), 5508 states have internal predecessors, (7420), 901 states have call successors, (901), 226 states have call predecessors, (901), 226 states have return successors, (901), 866 states have call predecessors, (901), 901 states have call successors, (901) [2025-03-03 22:50:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 9222 transitions. [2025-03-03 22:50:06,160 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 9222 transitions. Word has length 272 [2025-03-03 22:50:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:06,161 INFO L471 AbstractCegarLoop]: Abstraction has 6601 states and 9222 transitions. [2025-03-03 22:50:06,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 9222 transitions. [2025-03-03 22:50:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 22:50:06,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:06,166 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:06,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:50:06,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:06,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1259083789, now seen corresponding path program 1 times [2025-03-03 22:50:06,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:06,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185303047] [2025-03-03 22:50:06,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:06,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:06,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 22:50:06,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 22:50:06,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:06,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:50:08,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:08,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185303047] [2025-03-03 22:50:08,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185303047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:08,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:08,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:50:08,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406917074] [2025-03-03 22:50:08,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:08,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:50:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:08,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:50:08,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:50:08,100 INFO L87 Difference]: Start difference. First operand 6601 states and 9222 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 22:50:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:09,725 INFO L93 Difference]: Finished difference Result 15269 states and 21299 transitions. [2025-03-03 22:50:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:50:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 273 [2025-03-03 22:50:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:09,755 INFO L225 Difference]: With dead ends: 15269 [2025-03-03 22:50:09,756 INFO L226 Difference]: Without dead ends: 8750 [2025-03-03 22:50:09,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:50:09,767 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 773 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:09,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1093 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 22:50:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8750 states. [2025-03-03 22:50:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8750 to 6769. [2025-03-03 22:50:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6769 states, 5641 states have (on average 1.362878922176919) internal successors, (7688), 5676 states have internal predecessors, (7688), 901 states have call successors, (901), 226 states have call predecessors, (901), 226 states have return successors, (901), 866 states have call predecessors, (901), 901 states have call successors, (901) [2025-03-03 22:50:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 9490 transitions. [2025-03-03 22:50:10,238 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 9490 transitions. Word has length 273 [2025-03-03 22:50:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:10,239 INFO L471 AbstractCegarLoop]: Abstraction has 6769 states and 9490 transitions. [2025-03-03 22:50:10,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 22:50:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 9490 transitions. [2025-03-03 22:50:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 22:50:10,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:10,244 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:10,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:50:10,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:10,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 94225908, now seen corresponding path program 1 times [2025-03-03 22:50:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:10,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322971103] [2025-03-03 22:50:10,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:10,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 22:50:10,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 22:50:10,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:10,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:50:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322971103] [2025-03-03 22:50:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322971103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301347400] [2025-03-03 22:50:10,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:10,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:10,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:10,691 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-03 22:50:10,693 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-03 22:50:10,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 22:50:10,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 22:50:10,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:10,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:10,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 22:50:10,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1327 proven. 33 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2025-03-03 22:50:10,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:50:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 33 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:50:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301347400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:50:11,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:50:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-03 22:50:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935651654] [2025-03-03 22:50:11,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:50:11,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:50:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:11,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:50:11,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:50:11,230 INFO L87 Difference]: Start difference. First operand 6769 states and 9490 transitions. Second operand has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) [2025-03-03 22:50:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:12,264 INFO L93 Difference]: Finished difference Result 13762 states and 19266 transitions. [2025-03-03 22:50:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:50:12,265 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) Word has length 273 [2025-03-03 22:50:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:12,284 INFO L225 Difference]: With dead ends: 13762 [2025-03-03 22:50:12,284 INFO L226 Difference]: Without dead ends: 7075 [2025-03-03 22:50:12,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-03-03 22:50:12,294 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 594 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:12,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 653 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:50:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2025-03-03 22:50:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 6943. [2025-03-03 22:50:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6943 states, 5797 states have (on average 1.3517336553389685) internal successors, (7836), 5832 states have internal predecessors, (7836), 901 states have call successors, (901), 244 states have call predecessors, (901), 244 states have return successors, (901), 866 states have call predecessors, (901), 901 states have call successors, (901) [2025-03-03 22:50:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 9638 transitions. [2025-03-03 22:50:12,756 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 9638 transitions. Word has length 273 [2025-03-03 22:50:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:12,756 INFO L471 AbstractCegarLoop]: Abstraction has 6943 states and 9638 transitions. [2025-03-03 22:50:12,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) [2025-03-03 22:50:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 9638 transitions. [2025-03-03 22:50:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 22:50:12,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:12,761 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:12,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 22:50:12,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:12,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:12,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash 174361618, now seen corresponding path program 1 times [2025-03-03 22:50:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:12,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994799291] [2025-03-03 22:50:12,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:12,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 22:50:13,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 22:50:13,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:13,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:50:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994799291] [2025-03-03 22:50:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994799291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:14,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:50:14,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147680963] [2025-03-03 22:50:14,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:14,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:50:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:14,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:50:14,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:50:14,275 INFO L87 Difference]: Start difference. First operand 6943 states and 9638 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:15,446 INFO L93 Difference]: Finished difference Result 15838 states and 21912 transitions. [2025-03-03 22:50:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:50:15,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 274 [2025-03-03 22:50:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:15,473 INFO L225 Difference]: With dead ends: 15838 [2025-03-03 22:50:15,473 INFO L226 Difference]: Without dead ends: 8981 [2025-03-03 22:50:15,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:50:15,486 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 485 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:15,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1032 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:50:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8981 states. [2025-03-03 22:50:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8981 to 7422. [2025-03-03 22:50:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7422 states, 6276 states have (on average 1.3559592096876991) internal successors, (8510), 6311 states have internal predecessors, (8510), 901 states have call successors, (901), 244 states have call predecessors, (901), 244 states have return successors, (901), 866 states have call predecessors, (901), 901 states have call successors, (901) [2025-03-03 22:50:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7422 states to 7422 states and 10312 transitions. [2025-03-03 22:50:15,975 INFO L78 Accepts]: Start accepts. Automaton has 7422 states and 10312 transitions. Word has length 274 [2025-03-03 22:50:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:15,976 INFO L471 AbstractCegarLoop]: Abstraction has 7422 states and 10312 transitions. [2025-03-03 22:50:15,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 7422 states and 10312 transitions. [2025-03-03 22:50:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 22:50:15,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:15,981 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:15,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 22:50:15,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:15,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash 282631920, now seen corresponding path program 1 times [2025-03-03 22:50:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365353942] [2025-03-03 22:50:15,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:15,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 22:50:16,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 22:50:16,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:50:16,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:16,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365353942] [2025-03-03 22:50:16,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365353942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:16,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863155332] [2025-03-03 22:50:16,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:16,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:16,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:16,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:50:16,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 22:50:16,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 22:50:16,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 22:50:16,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:16,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:16,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 22:50:16,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1543 proven. 147 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2025-03-03 22:50:16,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:50:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 150 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-03-03 22:50:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863155332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:50:17,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:50:17,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-03-03 22:50:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882571789] [2025-03-03 22:50:17,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:50:17,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 22:50:17,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:17,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 22:50:17,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:50:17,234 INFO L87 Difference]: Start difference. First operand 7422 states and 10312 transitions. Second operand has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 6 states have call successors, (95), 3 states have call predecessors, (95), 7 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) [2025-03-03 22:50:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:18,770 INFO L93 Difference]: Finished difference Result 15634 states and 21317 transitions. [2025-03-03 22:50:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-03 22:50:18,771 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 6 states have call successors, (95), 3 states have call predecessors, (95), 7 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) Word has length 274 [2025-03-03 22:50:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:18,796 INFO L225 Difference]: With dead ends: 15634 [2025-03-03 22:50:18,796 INFO L226 Difference]: Without dead ends: 8298 [2025-03-03 22:50:18,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=543, Invalid=1527, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 22:50:18,810 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1207 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:18,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 578 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:50:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2025-03-03 22:50:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 7298. [2025-03-03 22:50:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7298 states, 5884 states have (on average 1.3128823929299795) internal successors, (7725), 5907 states have internal predecessors, (7725), 1068 states have call successors, (1068), 345 states have call predecessors, (1068), 345 states have return successors, (1068), 1045 states have call predecessors, (1068), 1068 states have call successors, (1068) [2025-03-03 22:50:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7298 states to 7298 states and 9861 transitions. [2025-03-03 22:50:19,479 INFO L78 Accepts]: Start accepts. Automaton has 7298 states and 9861 transitions. Word has length 274 [2025-03-03 22:50:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:19,479 INFO L471 AbstractCegarLoop]: Abstraction has 7298 states and 9861 transitions. [2025-03-03 22:50:19,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 6 states have call successors, (95), 3 states have call predecessors, (95), 7 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) [2025-03-03 22:50:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 7298 states and 9861 transitions. [2025-03-03 22:50:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 22:50:19,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:19,483 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:19,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 22:50:19,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 22:50:19,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:19,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 66417457, now seen corresponding path program 1 times [2025-03-03 22:50:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:19,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552727648] [2025-03-03 22:50:19,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:19,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:19,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 22:50:19,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 22:50:19,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:19,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:50:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:19,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552727648] [2025-03-03 22:50:19,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552727648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:19,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579860505] [2025-03-03 22:50:19,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:19,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:50:19,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 22:50:20,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 22:50:20,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 22:50:20,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:20,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:20,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 22:50:20,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2015 proven. 180 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-03-03 22:50:20,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:50:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 207 proven. 135 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-03 22:50:20,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579860505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:50:20,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:50:20,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-03-03 22:50:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20371681] [2025-03-03 22:50:20,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:50:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 22:50:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:20,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 22:50:20,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-03 22:50:20,937 INFO L87 Difference]: Start difference. First operand 7298 states and 9861 transitions. Second operand has 24 states, 23 states have (on average 7.217391304347826) internal successors, (166), 22 states have internal predecessors, (166), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) [2025-03-03 22:50:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:23,520 INFO L93 Difference]: Finished difference Result 18876 states and 25402 transitions. [2025-03-03 22:50:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-03 22:50:23,521 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.217391304347826) internal successors, (166), 22 states have internal predecessors, (166), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) Word has length 275 [2025-03-03 22:50:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:23,547 INFO L225 Difference]: With dead ends: 18876 [2025-03-03 22:50:23,547 INFO L226 Difference]: Without dead ends: 11581 [2025-03-03 22:50:23,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1221, Invalid=3069, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 22:50:23,559 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 3913 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3924 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 810 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:23,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3924 Valid, 802 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [810 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:50:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11581 states. [2025-03-03 22:50:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11581 to 6338. [2025-03-03 22:50:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 5413 states have (on average 1.3462035839645299) internal successors, (7287), 5420 states have internal predecessors, (7287), 679 states have call successors, (679), 245 states have call predecessors, (679), 245 states have return successors, (679), 672 states have call predecessors, (679), 679 states have call successors, (679) [2025-03-03 22:50:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 8645 transitions. [2025-03-03 22:50:24,122 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 8645 transitions. Word has length 275 [2025-03-03 22:50:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:24,123 INFO L471 AbstractCegarLoop]: Abstraction has 6338 states and 8645 transitions. [2025-03-03 22:50:24,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.217391304347826) internal successors, (166), 22 states have internal predecessors, (166), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) [2025-03-03 22:50:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 8645 transitions. [2025-03-03 22:50:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 22:50:24,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:24,127 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:24,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 22:50:24,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:24,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:24,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1498196316, now seen corresponding path program 1 times [2025-03-03 22:50:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651195067] [2025-03-03 22:50:24,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:24,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 22:50:24,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 22:50:24,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:24,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:50:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651195067] [2025-03-03 22:50:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651195067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925235654] [2025-03-03 22:50:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:30,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:30,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:30,089 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:50:30,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 22:50:30,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 22:50:30,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 22:50:30,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:30,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:30,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 22:50:30,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1619 proven. 138 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2025-03-03 22:50:31,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:50:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 22:50:31,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925235654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:50:31,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:50:31,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 28 [2025-03-03 22:50:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18290697] [2025-03-03 22:50:31,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:50:31,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 22:50:31,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:31,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 22:50:31,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2025-03-03 22:50:31,940 INFO L87 Difference]: Start difference. First operand 6338 states and 8645 transitions. Second operand has 28 states, 28 states have (on average 6.964285714285714) internal successors, (195), 28 states have internal predecessors, (195), 5 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) [2025-03-03 22:50:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:40,602 INFO L93 Difference]: Finished difference Result 24132 states and 33444 transitions. [2025-03-03 22:50:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-03 22:50:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.964285714285714) internal successors, (195), 28 states have internal predecessors, (195), 5 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) Word has length 275 [2025-03-03 22:50:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:40,632 INFO L225 Difference]: With dead ends: 24132 [2025-03-03 22:50:40,632 INFO L226 Difference]: Without dead ends: 17797 [2025-03-03 22:50:40,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2923 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1879, Invalid=7433, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 22:50:40,643 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 2165 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4498 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 4713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 4498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:40,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 3283 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 4498 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 22:50:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17797 states. [2025-03-03 22:50:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17797 to 7357. [2025-03-03 22:50:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7357 states, 6456 states have (on average 1.3726765799256506) internal successors, (8862), 6460 states have internal predecessors, (8862), 652 states have call successors, (652), 248 states have call predecessors, (652), 248 states have return successors, (652), 648 states have call predecessors, (652), 652 states have call successors, (652) [2025-03-03 22:50:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7357 states to 7357 states and 10166 transitions. [2025-03-03 22:50:41,257 INFO L78 Accepts]: Start accepts. Automaton has 7357 states and 10166 transitions. Word has length 275 [2025-03-03 22:50:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:41,258 INFO L471 AbstractCegarLoop]: Abstraction has 7357 states and 10166 transitions. [2025-03-03 22:50:41,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.964285714285714) internal successors, (195), 28 states have internal predecessors, (195), 5 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) [2025-03-03 22:50:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7357 states and 10166 transitions. [2025-03-03 22:50:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 22:50:41,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:41,262 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:41,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 22:50:41,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:41,463 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:41,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:41,463 INFO L85 PathProgramCache]: Analyzing trace with hash -36616317, now seen corresponding path program 1 times [2025-03-03 22:50:41,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:41,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733477351] [2025-03-03 22:50:41,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:41,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:41,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 22:50:41,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 22:50:41,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:41,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 150 proven. 78 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2025-03-03 22:50:41,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:41,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733477351] [2025-03-03 22:50:41,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733477351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:41,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819238810] [2025-03-03 22:50:41,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:41,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:41,807 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:50:41,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 22:50:41,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 22:50:41,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 22:50:41,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:41,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:41,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 22:50:41,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1985 proven. 87 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-03-03 22:50:42,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:50:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-03 22:50:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819238810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:50:42,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:50:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 24 [2025-03-03 22:50:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827359923] [2025-03-03 22:50:42,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:50:42,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 22:50:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:42,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 22:50:42,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-03-03 22:50:42,736 INFO L87 Difference]: Start difference. First operand 7357 states and 10166 transitions. Second operand has 24 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) [2025-03-03 22:50:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:45,299 INFO L93 Difference]: Finished difference Result 21289 states and 29056 transitions. [2025-03-03 22:50:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-03 22:50:45,300 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) Word has length 275 [2025-03-03 22:50:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:45,328 INFO L225 Difference]: With dead ends: 21289 [2025-03-03 22:50:45,329 INFO L226 Difference]: Without dead ends: 13935 [2025-03-03 22:50:45,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 542 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=850, Invalid=2230, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 22:50:45,342 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1436 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:45,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 962 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:50:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13935 states. [2025-03-03 22:50:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13935 to 2925. [2025-03-03 22:50:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2456 states have (on average 1.3053745928338762) internal successors, (3206), 2456 states have internal predecessors, (3206), 320 states have call successors, (320), 148 states have call predecessors, (320), 148 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2025-03-03 22:50:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3846 transitions. [2025-03-03 22:50:45,836 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3846 transitions. Word has length 275 [2025-03-03 22:50:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:45,837 INFO L471 AbstractCegarLoop]: Abstraction has 2925 states and 3846 transitions. [2025-03-03 22:50:45,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) [2025-03-03 22:50:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3846 transitions. [2025-03-03 22:50:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 22:50:45,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:45,839 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:45,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 22:50:46,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 22:50:46,040 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1053498786, now seen corresponding path program 1 times [2025-03-03 22:50:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240720461] [2025-03-03 22:50:46,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:46,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 22:50:46,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 22:50:46,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:46,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:50:46,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240720461] [2025-03-03 22:50:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240720461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:46,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:50:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721627446] [2025-03-03 22:50:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:46,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:50:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:46,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:50:46,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:50:46,431 INFO L87 Difference]: Start difference. First operand 2925 states and 3846 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:47,084 INFO L93 Difference]: Finished difference Result 6701 states and 8822 transitions. [2025-03-03 22:50:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:50:47,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 276 [2025-03-03 22:50:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:47,095 INFO L225 Difference]: With dead ends: 6701 [2025-03-03 22:50:47,095 INFO L226 Difference]: Without dead ends: 3779 [2025-03-03 22:50:47,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:50:47,099 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 259 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:47,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 496 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:50:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3779 states. [2025-03-03 22:50:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3779 to 2961. [2025-03-03 22:50:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2961 states, 2492 states have (on average 1.3057784911717496) internal successors, (3254), 2492 states have internal predecessors, (3254), 320 states have call successors, (320), 148 states have call predecessors, (320), 148 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2025-03-03 22:50:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 3894 transitions. [2025-03-03 22:50:47,489 INFO L78 Accepts]: Start accepts. Automaton has 2961 states and 3894 transitions. Word has length 276 [2025-03-03 22:50:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:47,489 INFO L471 AbstractCegarLoop]: Abstraction has 2961 states and 3894 transitions. [2025-03-03 22:50:47,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2961 states and 3894 transitions. [2025-03-03 22:50:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 22:50:47,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:47,492 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:47,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 22:50:47,492 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:47,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 758088254, now seen corresponding path program 1 times [2025-03-03 22:50:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:47,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777448149] [2025-03-03 22:50:47,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:47,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 22:50:47,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 22:50:47,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:47,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:50:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777448149] [2025-03-03 22:50:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777448149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:47,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:50:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286940781] [2025-03-03 22:50:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:47,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:50:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:47,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:50:47,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:50:47,563 INFO L87 Difference]: Start difference. First operand 2961 states and 3894 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:47,845 INFO L93 Difference]: Finished difference Result 2963 states and 3895 transitions. [2025-03-03 22:50:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:50:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 276 [2025-03-03 22:50:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:47,853 INFO L225 Difference]: With dead ends: 2963 [2025-03-03 22:50:47,853 INFO L226 Difference]: Without dead ends: 1517 [2025-03-03 22:50:47,855 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-03 22:50:47,855 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:47,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:50:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-03 22:50:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517. [2025-03-03 22:50:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1280 states have (on average 1.275) internal successors, (1632), 1280 states have internal predecessors, (1632), 160 states have call successors, (160), 76 states have call predecessors, (160), 76 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 22:50:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1952 transitions. [2025-03-03 22:50:48,134 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1952 transitions. Word has length 276 [2025-03-03 22:50:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:48,134 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1952 transitions. [2025-03-03 22:50:48,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1952 transitions. [2025-03-03 22:50:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 22:50:48,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:48,136 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:48,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 22:50:48,137 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:48,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1893273844, now seen corresponding path program 1 times [2025-03-03 22:50:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13766652] [2025-03-03 22:50:48,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:48,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 22:50:48,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 22:50:48,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:48,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 22:50:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:48,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13766652] [2025-03-03 22:50:48,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13766652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:48,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:50:48,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761216882] [2025-03-03 22:50:48,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:48,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:50:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:48,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:50:48,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:50:48,354 INFO L87 Difference]: Start difference. First operand 1517 states and 1952 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:48,768 INFO L93 Difference]: Finished difference Result 3373 states and 4381 transitions. [2025-03-03 22:50:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:50:48,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 278 [2025-03-03 22:50:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:48,777 INFO L225 Difference]: With dead ends: 3373 [2025-03-03 22:50:48,777 INFO L226 Difference]: Without dead ends: 1859 [2025-03-03 22:50:48,779 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-03 22:50:48,779 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 225 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:48,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 500 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:50:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-03-03 22:50:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1541. [2025-03-03 22:50:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1304 states have (on average 1.2699386503067485) internal successors, (1656), 1304 states have internal predecessors, (1656), 160 states have call successors, (160), 76 states have call predecessors, (160), 76 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 22:50:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1976 transitions. [2025-03-03 22:50:49,064 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1976 transitions. Word has length 278 [2025-03-03 22:50:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:49,064 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 1976 transitions. [2025-03-03 22:50:49,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 22:50:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1976 transitions. [2025-03-03 22:50:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 22:50:49,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:49,066 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:50:49,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 22:50:49,066 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:49,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash 324484109, now seen corresponding path program 1 times [2025-03-03 22:50:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293654748] [2025-03-03 22:50:49,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:49,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 22:50:49,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 22:50:49,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:49,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:50:49,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683214784] [2025-03-03 22:50:49,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:49,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:49,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:49,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:50:49,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 22:50:49,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 22:50:49,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 22:50:49,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:49,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:49,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 22:50:49,342 INFO L279 TraceCheckSpWp]: Computing forward predicates...