./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.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 938d0421a545f95d5fd4476ad4101c37e59d7c0d9287a6793e2d4f45bec79d41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:16,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:16,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:07:16,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:16,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:16,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:16,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:16,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:16,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:16,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:16,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:16,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:16,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:16,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:16,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:16,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:16,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:16,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:16,354 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 -> 938d0421a545f95d5fd4476ad4101c37e59d7c0d9287a6793e2d4f45bec79d41 [2025-03-04 00:07:16,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:16,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:16,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:16,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:16,600 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:16,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.i [2025-03-04 00:07:17,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36635b432/e1aeab612df84bcd91b81d8a21c55af8/FLAG831aed2f5 [2025-03-04 00:07:17,994 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:17,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.i [2025-03-04 00:07:18,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36635b432/e1aeab612df84bcd91b81d8a21c55af8/FLAG831aed2f5 [2025-03-04 00:07:18,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36635b432/e1aeab612df84bcd91b81d8a21c55af8 [2025-03-04 00:07:18,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:18,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:18,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:18,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:18,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:18,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18, skipping insertion in model container [2025-03-04 00:07:18,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:18,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.i[916,929] [2025-03-04 00:07:18,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:18,263 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:18,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.i[916,929] [2025-03-04 00:07:18,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:18,348 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:18,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18 WrapperNode [2025-03-04 00:07:18,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:18,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:18,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:18,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:18,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,407 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2025-03-04 00:07:18,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:18,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:18,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:18,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:18,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,460 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:07:18,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:18,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:18,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:18,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:18,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (1/1) ... [2025-03-04 00:07:18,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:18,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:18,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:07:18,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:07:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:18,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:07:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:18,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:18,639 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:18,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:19,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: havoc property_#t~bitwise36#1;havoc property_#t~bitwise37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1; [2025-03-04 00:07:19,286 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:19,287 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:19,307 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:19,309 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:19,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:19 BoogieIcfgContainer [2025-03-04 00:07:19,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:19,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:19,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:19,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:19,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:18" (1/3) ... [2025-03-04 00:07:19,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425256ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:19, skipping insertion in model container [2025-03-04 00:07:19,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:18" (2/3) ... [2025-03-04 00:07:19,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425256ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:19, skipping insertion in model container [2025-03-04 00:07:19,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:19" (3/3) ... [2025-03-04 00:07:19,317 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-11.i [2025-03-04 00:07:19,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:19,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-11.i that has 2 procedures, 174 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:19,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:19,411 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;@4af675be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:19,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:07:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-04 00:07:19,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:19,428 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:19,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:19,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:19,432 INFO L85 PathProgramCache]: Analyzing trace with hash 327161117, now seen corresponding path program 1 times [2025-03-04 00:07:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418444169] [2025-03-04 00:07:19,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:19,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 00:07:19,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 00:07:19,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:19,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:19,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418444169] [2025-03-04 00:07:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418444169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:19,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:19,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:07:19,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085034561] [2025-03-04 00:07:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:19,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:07:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:19,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:07:19,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:19,949 INFO L87 Difference]: Start difference. First operand has 174 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:19,999 INFO L93 Difference]: Finished difference Result 340 states and 590 transitions. [2025-03-04 00:07:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:07:20,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-03-04 00:07:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:20,025 INFO L225 Difference]: With dead ends: 340 [2025-03-04 00:07:20,025 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 00:07:20,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:20,032 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:20,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 00:07:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-04 00:07:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:07:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 265 transitions. [2025-03-04 00:07:20,080 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 265 transitions. Word has length 313 [2025-03-04 00:07:20,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:20,084 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 265 transitions. [2025-03-04 00:07:20,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 265 transitions. [2025-03-04 00:07:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-04 00:07:20,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:20,090 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:20,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:07:20,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:20,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash 72424572, now seen corresponding path program 1 times [2025-03-04 00:07:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:20,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629327077] [2025-03-04 00:07:20,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:20,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 00:07:20,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 00:07:20,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:20,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629327077] [2025-03-04 00:07:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629327077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:20,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:07:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713767358] [2025-03-04 00:07:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:20,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:07:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:20,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:07:20,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:20,544 INFO L87 Difference]: Start difference. First operand 169 states and 265 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:20,818 INFO L93 Difference]: Finished difference Result 502 states and 790 transitions. [2025-03-04 00:07:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:07:20,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-03-04 00:07:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:20,822 INFO L225 Difference]: With dead ends: 502 [2025-03-04 00:07:20,824 INFO L226 Difference]: Without dead ends: 336 [2025-03-04 00:07:20,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:20,827 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 207 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:20,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 759 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:07:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-04 00:07:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 327. [2025-03-04 00:07:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 234 states have (on average 1.4401709401709402) internal successors, (337), 234 states have internal predecessors, (337), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:07:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 517 transitions. [2025-03-04 00:07:20,886 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 517 transitions. Word has length 313 [2025-03-04 00:07:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:20,887 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 517 transitions. [2025-03-04 00:07:20,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 517 transitions. [2025-03-04 00:07:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-04 00:07:20,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:20,894 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:20,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:07:20,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:20,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1792787622, now seen corresponding path program 1 times [2025-03-04 00:07:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:20,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803021538] [2025-03-04 00:07:20,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:20,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:20,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-04 00:07:20,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-04 00:07:20,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:20,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803021538] [2025-03-04 00:07:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803021538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:21,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:21,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:07:21,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197067400] [2025-03-04 00:07:21,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:21,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:07:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:21,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:07:21,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:07:21,156 INFO L87 Difference]: Start difference. First operand 327 states and 517 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:21,273 INFO L93 Difference]: Finished difference Result 754 states and 1192 transitions. [2025-03-04 00:07:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:07:21,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 314 [2025-03-04 00:07:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:21,283 INFO L225 Difference]: With dead ends: 754 [2025-03-04 00:07:21,284 INFO L226 Difference]: Without dead ends: 540 [2025-03-04 00:07:21,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:07:21,285 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 220 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:21,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 614 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-04 00:07:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 389. [2025-03-04 00:07:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 296 states have (on average 1.4493243243243243) internal successors, (429), 296 states have internal predecessors, (429), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:07:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 609 transitions. [2025-03-04 00:07:21,335 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 609 transitions. Word has length 314 [2025-03-04 00:07:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:21,335 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 609 transitions. [2025-03-04 00:07:21,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 609 transitions. [2025-03-04 00:07:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-04 00:07:21,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:21,338 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:21,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:07:21,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:21,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1838657299, now seen corresponding path program 1 times [2025-03-04 00:07:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:21,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873748730] [2025-03-04 00:07:21,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:21,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-04 00:07:21,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 00:07:21,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:21,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:22,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:22,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873748730] [2025-03-04 00:07:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873748730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:22,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:07:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060164977] [2025-03-04 00:07:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:07:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:22,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:07:22,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:07:22,847 INFO L87 Difference]: Start difference. First operand 389 states and 609 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:07:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:23,732 INFO L93 Difference]: Finished difference Result 941 states and 1457 transitions. [2025-03-04 00:07:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:07:23,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 315 [2025-03-04 00:07:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:23,736 INFO L225 Difference]: With dead ends: 941 [2025-03-04 00:07:23,737 INFO L226 Difference]: Without dead ends: 693 [2025-03-04 00:07:23,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:07:23,738 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 848 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:23,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1635 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:07:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-04 00:07:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 444. [2025-03-04 00:07:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 350 states have (on average 1.4542857142857142) internal successors, (509), 350 states have internal predecessors, (509), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:07:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 689 transitions. [2025-03-04 00:07:23,771 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 689 transitions. Word has length 315 [2025-03-04 00:07:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:23,772 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 689 transitions. [2025-03-04 00:07:23,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:07:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 689 transitions. [2025-03-04 00:07:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-04 00:07:23,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:23,774 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:23,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:07:23,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:23,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash -705466706, now seen corresponding path program 1 times [2025-03-04 00:07:23,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:23,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270830759] [2025-03-04 00:07:23,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:23,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-04 00:07:24,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 00:07:24,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:24,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:27,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270830759] [2025-03-04 00:07:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270830759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:27,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:07:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085044305] [2025-03-04 00:07:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:27,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:07:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:27,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:07:27,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:07:27,792 INFO L87 Difference]: Start difference. First operand 444 states and 689 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-04 00:07:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:30,556 INFO L93 Difference]: Finished difference Result 968 states and 1495 transitions. [2025-03-04 00:07:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:07:30,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 315 [2025-03-04 00:07:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:30,560 INFO L225 Difference]: With dead ends: 968 [2025-03-04 00:07:30,560 INFO L226 Difference]: Without dead ends: 671 [2025-03-04 00:07:30,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:07:30,561 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 1345 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:30,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1448 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:07:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-04 00:07:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 588. [2025-03-04 00:07:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 494 states have (on average 1.4817813765182186) internal successors, (732), 494 states have internal predecessors, (732), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:07:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 912 transitions. [2025-03-04 00:07:30,584 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 912 transitions. Word has length 315 [2025-03-04 00:07:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:30,584 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 912 transitions. [2025-03-04 00:07:30,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-04 00:07:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 912 transitions. [2025-03-04 00:07:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-04 00:07:30,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:30,587 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:30,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:07:30,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:30,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash -694150579, now seen corresponding path program 1 times [2025-03-04 00:07:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956467577] [2025-03-04 00:07:30,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:30,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-04 00:07:30,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 00:07:30,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:30,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:32,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956467577] [2025-03-04 00:07:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956467577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:32,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:07:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702907869] [2025-03-04 00:07:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:07:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:32,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:07:32,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:07:32,152 INFO L87 Difference]: Start difference. First operand 588 states and 912 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:07:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:32,870 INFO L93 Difference]: Finished difference Result 898 states and 1382 transitions. [2025-03-04 00:07:32,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:07:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 315 [2025-03-04 00:07:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:32,874 INFO L225 Difference]: With dead ends: 898 [2025-03-04 00:07:32,874 INFO L226 Difference]: Without dead ends: 621 [2025-03-04 00:07:32,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:07:32,876 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 743 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:32,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1330 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:07:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-04 00:07:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 592. [2025-03-04 00:07:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 498 states have (on average 1.4779116465863453) internal successors, (736), 498 states have internal predecessors, (736), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:07:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 916 transitions. [2025-03-04 00:07:32,905 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 916 transitions. Word has length 315 [2025-03-04 00:07:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:32,905 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 916 transitions. [2025-03-04 00:07:32,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:07:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 916 transitions. [2025-03-04 00:07:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-04 00:07:32,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:32,907 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:07:32,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:32,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash 938653420, now seen corresponding path program 1 times [2025-03-04 00:07:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:32,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499483224] [2025-03-04 00:07:32,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:32,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-04 00:07:33,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 00:07:33,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:33,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:07:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499483224] [2025-03-04 00:07:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499483224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145315296] [2025-03-04 00:07:33,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:33,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:33,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:33,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:07:33,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:07:33,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-04 00:07:33,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 00:07:33,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:33,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:33,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:07:33,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 384 proven. 126 refuted. 0 times theorem prover too weak. 3450 trivial. 0 not checked. [2025-03-04 00:07:33,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:07:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145315296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:34,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:07:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259921232] [2025-03-04 00:07:34,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:34,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:07:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:34,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:07:34,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:07:34,157 INFO L87 Difference]: Start difference. First operand 592 states and 916 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-03-04 00:07:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:34,378 INFO L93 Difference]: Finished difference Result 985 states and 1520 transitions. [2025-03-04 00:07:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:07:34,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 315 [2025-03-04 00:07:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:34,381 INFO L225 Difference]: With dead ends: 985 [2025-03-04 00:07:34,381 INFO L226 Difference]: Without dead ends: 606 [2025-03-04 00:07:34,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:07:34,383 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 124 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:34,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 508 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:07:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-04 00:07:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 596. [2025-03-04 00:07:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 500 states have (on average 1.448) internal successors, (724), 500 states have internal predecessors, (724), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:07:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 904 transitions. [2025-03-04 00:07:34,424 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 904 transitions. Word has length 315 [2025-03-04 00:07:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:34,424 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 904 transitions. [2025-03-04 00:07:34,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-03-04 00:07:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 904 transitions. [2025-03-04 00:07:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:07:34,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:34,426 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:34,435 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-04 00:07:34,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:34,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:34,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash 526635115, now seen corresponding path program 1 times [2025-03-04 00:07:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892894601] [2025-03-04 00:07:34,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:34,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:34,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:07:34,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:07:34,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:34,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:36,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:36,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892894601] [2025-03-04 00:07:36,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892894601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:36,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:36,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:07:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332614941] [2025-03-04 00:07:36,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:36,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:07:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:36,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:07:36,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:07:36,337 INFO L87 Difference]: Start difference. First operand 596 states and 904 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:07:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:37,053 INFO L93 Difference]: Finished difference Result 906 states and 1364 transitions. [2025-03-04 00:07:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:07:37,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 317 [2025-03-04 00:07:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:37,058 INFO L225 Difference]: With dead ends: 906 [2025-03-04 00:07:37,058 INFO L226 Difference]: Without dead ends: 625 [2025-03-04 00:07:37,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:07:37,060 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 457 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:37,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1667 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:07:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-04 00:07:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 596. [2025-03-04 00:07:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 500 states have (on average 1.44) internal successors, (720), 500 states have internal predecessors, (720), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:07:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 900 transitions. [2025-03-04 00:07:37,086 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 900 transitions. Word has length 317 [2025-03-04 00:07:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:37,087 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 900 transitions. [2025-03-04 00:07:37,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:07:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 900 transitions. [2025-03-04 00:07:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:07:37,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:37,089 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:37,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:07:37,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:37,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash -396048468, now seen corresponding path program 1 times [2025-03-04 00:07:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:37,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076479003] [2025-03-04 00:07:37,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:37,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:37,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:07:37,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:07:37,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:37,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 111 proven. 21 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:07:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076479003] [2025-03-04 00:07:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076479003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241321642] [2025-03-04 00:07:37,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:37,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:37,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:37,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:07:37,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:07:37,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:07:37,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:07:37,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:37,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:37,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:07:37,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1952 proven. 78 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2025-03-04 00:07:38,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:07:38,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241321642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:38,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:38,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-03-04 00:07:38,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765734724] [2025-03-04 00:07:38,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:38,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:07:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:38,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:07:38,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:07:38,440 INFO L87 Difference]: Start difference. First operand 596 states and 900 transitions. Second operand has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) [2025-03-04 00:07:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:40,039 INFO L93 Difference]: Finished difference Result 2102 states and 3201 transitions. [2025-03-04 00:07:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 00:07:40,040 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) Word has length 317 [2025-03-04 00:07:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:40,046 INFO L225 Difference]: With dead ends: 2102 [2025-03-04 00:07:40,046 INFO L226 Difference]: Without dead ends: 1631 [2025-03-04 00:07:40,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=1572, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 00:07:40,048 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 1686 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:40,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 1568 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:07:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-04 00:07:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1346. [2025-03-04 00:07:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1203 states have (on average 1.4380714879467997) internal successors, (1730), 1204 states have internal predecessors, (1730), 127 states have call successors, (127), 15 states have call predecessors, (127), 15 states have return successors, (127), 126 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-04 00:07:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1984 transitions. [2025-03-04 00:07:40,102 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1984 transitions. Word has length 317 [2025-03-04 00:07:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:40,102 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1984 transitions. [2025-03-04 00:07:40,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) [2025-03-04 00:07:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1984 transitions. [2025-03-04 00:07:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-04 00:07:40,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:40,105 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:40,113 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-04 00:07:40,305 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,SelfDestructingSolverStorable8 [2025-03-04 00:07:40,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:40,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash -530888611, now seen corresponding path program 1 times [2025-03-04 00:07:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:40,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018778807] [2025-03-04 00:07:40,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:40,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-04 00:07:40,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-04 00:07:40,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:40,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018778807] [2025-03-04 00:07:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018778807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:40,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:07:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933070541] [2025-03-04 00:07:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:40,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:07:40,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:40,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:07:40,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:40,833 INFO L87 Difference]: Start difference. First operand 1346 states and 1984 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:41,138 INFO L93 Difference]: Finished difference Result 1968 states and 2910 transitions. [2025-03-04 00:07:41,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:07:41,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 318 [2025-03-04 00:07:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:41,144 INFO L225 Difference]: With dead ends: 1968 [2025-03-04 00:07:41,144 INFO L226 Difference]: Without dead ends: 1345 [2025-03-04 00:07:41,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:07:41,146 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 305 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:41,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 951 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:07:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-04 00:07:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1292. [2025-03-04 00:07:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1149 states have (on average 1.4360313315926894) internal successors, (1650), 1150 states have internal predecessors, (1650), 127 states have call successors, (127), 15 states have call predecessors, (127), 15 states have return successors, (127), 126 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-04 00:07:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1904 transitions. [2025-03-04 00:07:41,192 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1904 transitions. Word has length 318 [2025-03-04 00:07:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:41,194 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1904 transitions. [2025-03-04 00:07:41,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1904 transitions. [2025-03-04 00:07:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-04 00:07:41,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:41,196 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:41,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:07:41,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:41,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash -179318659, now seen corresponding path program 1 times [2025-03-04 00:07:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170034410] [2025-03-04 00:07:41,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:41,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:41,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-04 00:07:41,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-04 00:07:41,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:41,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:07:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170034410] [2025-03-04 00:07:41,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170034410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323587485] [2025-03-04 00:07:41,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:41,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:41,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:41,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:07:41,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:07:41,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-04 00:07:42,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-04 00:07:42,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:42,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:42,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 00:07:42,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2088 proven. 231 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2025-03-04 00:07:43,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323587485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:43,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:07:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17] total 24 [2025-03-04 00:07:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952372335] [2025-03-04 00:07:43,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 00:07:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:43,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 00:07:43,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:07:43,996 INFO L87 Difference]: Start difference. First operand 1292 states and 1904 transitions. Second operand has 24 states, 24 states have (on average 8.25) internal successors, (198), 23 states have internal predecessors, (198), 6 states have call successors, (90), 5 states have call predecessors, (90), 8 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-03-04 00:07:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:47,243 INFO L93 Difference]: Finished difference Result 3492 states and 5017 transitions. [2025-03-04 00:07:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-04 00:07:47,244 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.25) internal successors, (198), 23 states have internal predecessors, (198), 6 states have call successors, (90), 5 states have call predecessors, (90), 8 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) Word has length 318 [2025-03-04 00:07:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:47,260 INFO L225 Difference]: With dead ends: 3492 [2025-03-04 00:07:47,260 INFO L226 Difference]: Without dead ends: 2467 [2025-03-04 00:07:47,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1424, Invalid=6586, Unknown=0, NotChecked=0, Total=8010 [2025-03-04 00:07:47,265 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1653 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 3264 SdHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:47,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 3264 Invalid, 4426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 00:07:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2025-03-04 00:07:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 1939. [2025-03-04 00:07:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1720 states have (on average 1.4145348837209302) internal successors, (2433), 1725 states have internal predecessors, (2433), 191 states have call successors, (191), 27 states have call predecessors, (191), 27 states have return successors, (191), 186 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-04 00:07:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2815 transitions. [2025-03-04 00:07:47,355 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2815 transitions. Word has length 318 [2025-03-04 00:07:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:47,355 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 2815 transitions. [2025-03-04 00:07:47,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.25) internal successors, (198), 23 states have internal predecessors, (198), 6 states have call successors, (90), 5 states have call predecessors, (90), 8 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-03-04 00:07:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2815 transitions. [2025-03-04 00:07:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-04 00:07:47,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:47,358 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:47,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:07:47,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:47,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:47,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1943161053, now seen corresponding path program 1 times [2025-03-04 00:07:47,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:47,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612056103] [2025-03-04 00:07:47,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:47,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-04 00:07:47,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-04 00:07:47,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:47,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:47,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:47,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612056103] [2025-03-04 00:07:47,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612056103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:47,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:47,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:07:47,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494207306] [2025-03-04 00:07:47,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:47,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:07:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:47,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:07:47,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:47,806 INFO L87 Difference]: Start difference. First operand 1939 states and 2815 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:47,877 INFO L93 Difference]: Finished difference Result 2712 states and 3912 transitions. [2025-03-04 00:07:47,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:07:47,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 318 [2025-03-04 00:07:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:47,884 INFO L225 Difference]: With dead ends: 2712 [2025-03-04 00:07:47,884 INFO L226 Difference]: Without dead ends: 1827 [2025-03-04 00:07:47,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:47,886 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:47,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2025-03-04 00:07:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1827. [2025-03-04 00:07:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1608 states have (on average 1.3837064676616915) internal successors, (2225), 1613 states have internal predecessors, (2225), 191 states have call successors, (191), 27 states have call predecessors, (191), 27 states have return successors, (191), 186 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-04 00:07:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2607 transitions. [2025-03-04 00:07:47,955 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2607 transitions. Word has length 318 [2025-03-04 00:07:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:47,956 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2607 transitions. [2025-03-04 00:07:47,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2607 transitions. [2025-03-04 00:07:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-04 00:07:47,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:47,959 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:47,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:07:47,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:47,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1569144204, now seen corresponding path program 1 times [2025-03-04 00:07:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:47,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383112659] [2025-03-04 00:07:47,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:47,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-04 00:07:48,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-04 00:07:48,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:48,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:07:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383112659] [2025-03-04 00:07:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383112659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:48,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:07:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164590396] [2025-03-04 00:07:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:48,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:07:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:48,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:07:48,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:48,225 INFO L87 Difference]: Start difference. First operand 1827 states and 2607 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:48,532 INFO L93 Difference]: Finished difference Result 3842 states and 5540 transitions. [2025-03-04 00:07:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:07:48,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 319 [2025-03-04 00:07:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:48,541 INFO L225 Difference]: With dead ends: 3842 [2025-03-04 00:07:48,542 INFO L226 Difference]: Without dead ends: 3065 [2025-03-04 00:07:48,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:48,544 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 395 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:48,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 858 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:07:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2025-03-04 00:07:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2155. [2025-03-04 00:07:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1936 states have (on average 1.3920454545454546) internal successors, (2695), 1941 states have internal predecessors, (2695), 191 states have call successors, (191), 27 states have call predecessors, (191), 27 states have return successors, (191), 186 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-04 00:07:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3077 transitions. [2025-03-04 00:07:48,654 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3077 transitions. Word has length 319 [2025-03-04 00:07:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:48,655 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 3077 transitions. [2025-03-04 00:07:48,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:07:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3077 transitions. [2025-03-04 00:07:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-04 00:07:48,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:48,659 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:48,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:07:48,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:48,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1275741197, now seen corresponding path program 1 times [2025-03-04 00:07:48,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:48,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479136236] [2025-03-04 00:07:48,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:48,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-04 00:07:48,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-04 00:07:48,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:48,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 48 proven. 84 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:07:50,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:50,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479136236] [2025-03-04 00:07:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479136236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:50,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174737539] [2025-03-04 00:07:50,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:50,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:50,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:50,031 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:07:50,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:07:50,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-04 00:07:50,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-04 00:07:50,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:50,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 00:07:50,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1878 proven. 243 refuted. 0 times theorem prover too weak. 1839 trivial. 0 not checked. [2025-03-04 00:07:51,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 96 proven. 165 refuted. 0 times theorem prover too weak. 3699 trivial. 0 not checked. [2025-03-04 00:07:53,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174737539] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:53,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 19] total 47 [2025-03-04 00:07:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346339130] [2025-03-04 00:07:53,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:53,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 00:07:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:53,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 00:07:53,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1827, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 00:07:53,161 INFO L87 Difference]: Start difference. First operand 2155 states and 3077 transitions. Second operand has 47 states, 46 states have (on average 5.195652173913044) internal successors, (239), 45 states have internal predecessors, (239), 10 states have call successors, (135), 5 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) [2025-03-04 00:08:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:18,378 INFO L93 Difference]: Finished difference Result 18383 states and 26045 transitions. [2025-03-04 00:08:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2025-03-04 00:08:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 5.195652173913044) internal successors, (239), 45 states have internal predecessors, (239), 10 states have call successors, (135), 5 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) Word has length 319 [2025-03-04 00:08:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:18,429 INFO L225 Difference]: With dead ends: 18383 [2025-03-04 00:08:18,429 INFO L226 Difference]: Without dead ends: 17072 [2025-03-04 00:08:18,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41889 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14441, Invalid=80115, Unknown=0, NotChecked=0, Total=94556 [2025-03-04 00:08:18,497 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 11433 mSDsluCounter, 10578 mSDsCounter, 0 mSdLazyCounter, 16961 mSolverCounterSat, 3755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11484 SdHoareTripleChecker+Valid, 11322 SdHoareTripleChecker+Invalid, 20716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3755 IncrementalHoareTripleChecker+Valid, 16961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:18,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11484 Valid, 11322 Invalid, 20716 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3755 Valid, 16961 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2025-03-04 00:08:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17072 states. [2025-03-04 00:08:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17072 to 3807. [2025-03-04 00:08:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 3426 states have (on average 1.4025102159953298) internal successors, (4805), 3436 states have internal predecessors, (4805), 333 states have call successors, (333), 47 states have call predecessors, (333), 47 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-04 00:08:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 5471 transitions. [2025-03-04 00:08:18,820 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 5471 transitions. Word has length 319 [2025-03-04 00:08:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:18,820 INFO L471 AbstractCegarLoop]: Abstraction has 3807 states and 5471 transitions. [2025-03-04 00:08:18,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 5.195652173913044) internal successors, (239), 45 states have internal predecessors, (239), 10 states have call successors, (135), 5 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) [2025-03-04 00:08:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 5471 transitions. [2025-03-04 00:08:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 00:08:18,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:18,829 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:08:18,838 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-04 00:08:19,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:19,029 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1398462873, now seen corresponding path program 1 times [2025-03-04 00:08:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881111223] [2025-03-04 00:08:19,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:19,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 00:08:19,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 00:08:19,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:19,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:08:19,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:19,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881111223] [2025-03-04 00:08:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881111223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:19,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:19,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:08:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585787497] [2025-03-04 00:08:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:19,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:08:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:19,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:08:19,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:08:19,399 INFO L87 Difference]: Start difference. First operand 3807 states and 5471 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:08:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:20,085 INFO L93 Difference]: Finished difference Result 6671 states and 9538 transitions. [2025-03-04 00:08:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:08:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 320 [2025-03-04 00:08:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:20,097 INFO L225 Difference]: With dead ends: 6671 [2025-03-04 00:08:20,097 INFO L226 Difference]: Without dead ends: 4549 [2025-03-04 00:08:20,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:08:20,101 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 783 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:20,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1303 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:08:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2025-03-04 00:08:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4365. [2025-03-04 00:08:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4365 states, 3984 states have (on average 1.4066265060240963) internal successors, (5604), 3994 states have internal predecessors, (5604), 333 states have call successors, (333), 47 states have call predecessors, (333), 47 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-04 00:08:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6270 transitions. [2025-03-04 00:08:20,365 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6270 transitions. Word has length 320 [2025-03-04 00:08:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:20,366 INFO L471 AbstractCegarLoop]: Abstraction has 4365 states and 6270 transitions. [2025-03-04 00:08:20,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:08:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6270 transitions. [2025-03-04 00:08:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 00:08:20,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:20,370 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:08:20,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:08:20,370 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1105059866, now seen corresponding path program 1 times [2025-03-04 00:08:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248907541] [2025-03-04 00:08:20,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:20,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 00:08:20,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 00:08:20,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:20,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:08:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248907541] [2025-03-04 00:08:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248907541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:21,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:21,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:08:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502718516] [2025-03-04 00:08:21,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:21,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:08:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:21,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:08:21,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:08:21,895 INFO L87 Difference]: Start difference. First operand 4365 states and 6270 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:08:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:22,842 INFO L93 Difference]: Finished difference Result 6761 states and 9662 transitions. [2025-03-04 00:08:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:08:22,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 320 [2025-03-04 00:08:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:22,852 INFO L225 Difference]: With dead ends: 6761 [2025-03-04 00:08:22,852 INFO L226 Difference]: Without dead ends: 4455 [2025-03-04 00:08:22,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:08:22,857 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 976 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:22,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1261 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:08:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4455 states. [2025-03-04 00:08:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4455 to 4287. [2025-03-04 00:08:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 3906 states have (on average 1.4045058883768562) internal successors, (5486), 3916 states have internal predecessors, (5486), 333 states have call successors, (333), 47 states have call predecessors, (333), 47 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-04 00:08:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6152 transitions. [2025-03-04 00:08:23,211 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6152 transitions. Word has length 320 [2025-03-04 00:08:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:23,211 INFO L471 AbstractCegarLoop]: Abstraction has 4287 states and 6152 transitions. [2025-03-04 00:08:23,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:08:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6152 transitions. [2025-03-04 00:08:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 00:08:23,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:23,217 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:08:23,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:08:23,217 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1418800248, now seen corresponding path program 1 times [2025-03-04 00:08:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:23,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044241311] [2025-03-04 00:08:23,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:23,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:23,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 00:08:23,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 00:08:23,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:23,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:08:26,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044241311] [2025-03-04 00:08:26,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044241311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:26,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 00:08:26,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458368037] [2025-03-04 00:08:26,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:26,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:08:26,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:26,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:08:26,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:08:26,237 INFO L87 Difference]: Start difference. First operand 4287 states and 6152 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-04 00:08:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:28,555 INFO L93 Difference]: Finished difference Result 7289 states and 10361 transitions. [2025-03-04 00:08:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:08:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 320 [2025-03-04 00:08:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:28,565 INFO L225 Difference]: With dead ends: 7289 [2025-03-04 00:08:28,565 INFO L226 Difference]: Without dead ends: 5207 [2025-03-04 00:08:28,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:08:28,569 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 2268 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2268 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:28,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2268 Valid, 1680 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:08:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2025-03-04 00:08:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 4469. [2025-03-04 00:08:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4469 states, 4088 states have (on average 1.4045988258317026) internal successors, (5742), 4098 states have internal predecessors, (5742), 333 states have call successors, (333), 47 states have call predecessors, (333), 47 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-04 00:08:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 6408 transitions. [2025-03-04 00:08:28,774 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 6408 transitions. Word has length 320 [2025-03-04 00:08:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:28,774 INFO L471 AbstractCegarLoop]: Abstraction has 4469 states and 6408 transitions. [2025-03-04 00:08:28,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-04 00:08:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 6408 transitions. [2025-03-04 00:08:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 00:08:28,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:28,779 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:08:28,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:08:28,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1125397241, now seen corresponding path program 1 times [2025-03-04 00:08:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174651678] [2025-03-04 00:08:28,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:28,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 00:08:28,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 00:08:28,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:28,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 105 proven. 27 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:08:29,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:29,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174651678] [2025-03-04 00:08:29,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174651678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:29,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9463709] [2025-03-04 00:08:29,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:29,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:29,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:29,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:08:29,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:08:29,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 00:08:29,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 00:08:29,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:29,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:29,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:08:29,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1374 proven. 27 refuted. 0 times theorem prover too weak. 2559 trivial. 0 not checked. [2025-03-04 00:08:29,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 105 proven. 27 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:08:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9463709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:08:29,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:08:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:08:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113439141] [2025-03-04 00:08:29,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:08:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:29,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:08:29,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:08:29,522 INFO L87 Difference]: Start difference. First operand 4469 states and 6408 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 00:08:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:30,003 INFO L93 Difference]: Finished difference Result 8655 states and 12408 transitions. [2025-03-04 00:08:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:08:30,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 320 [2025-03-04 00:08:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:30,012 INFO L225 Difference]: With dead ends: 8655 [2025-03-04 00:08:30,012 INFO L226 Difference]: Without dead ends: 4527 [2025-03-04 00:08:30,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 637 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:08:30,017 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 179 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:30,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 705 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:08:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2025-03-04 00:08:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4489. [2025-03-04 00:08:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4103 states have (on average 1.3987326346575677) internal successors, (5739), 4113 states have internal predecessors, (5739), 333 states have call successors, (333), 52 states have call predecessors, (333), 52 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-03-04 00:08:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6405 transitions. [2025-03-04 00:08:30,219 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6405 transitions. Word has length 320 [2025-03-04 00:08:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:30,219 INFO L471 AbstractCegarLoop]: Abstraction has 4489 states and 6405 transitions. [2025-03-04 00:08:30,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 00:08:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6405 transitions. [2025-03-04 00:08:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 00:08:30,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:30,223 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:08:30,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:08:30,423 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,SelfDestructingSolverStorable17 [2025-03-04 00:08:30,424 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:30,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1100560732, now seen corresponding path program 1 times [2025-03-04 00:08:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:30,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458142902] [2025-03-04 00:08:30,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:30,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 00:08:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 00:08:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:08:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458142902] [2025-03-04 00:08:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458142902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 00:08:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285589834] [2025-03-04 00:08:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:08:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:36,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:08:36,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:08:36,568 INFO L87 Difference]: Start difference. First operand 4489 states and 6405 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45)