./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_amount100_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cada0c85d469bf843d2b88bb91f13bf498b21137f0d387bee03f08915f85ad4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:09:57,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:09:57,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:09:57,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:09:57,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:09:57,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:09:57,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:09:57,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:09:57,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:09:57,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:09:57,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:09:57,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:09:57,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:09:57,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:09:57,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:09:57,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:09:57,238 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 -> 9cada0c85d469bf843d2b88bb91f13bf498b21137f0d387bee03f08915f85ad4 [2025-03-08 15:09:57,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:09:57,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:09:57,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:09:57,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:09:57,500 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:09:57,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i [2025-03-08 15:09:58,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da309cd4/cc1f8f804001416e8f88045aca329707/FLAG3881e848b [2025-03-08 15:09:59,000 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:09:59,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i [2025-03-08 15:09:59,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da309cd4/cc1f8f804001416e8f88045aca329707/FLAG3881e848b [2025-03-08 15:09:59,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da309cd4/cc1f8f804001416e8f88045aca329707 [2025-03-08 15:09:59,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:09:59,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:09:59,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:09:59,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:09:59,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:09:59,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59, skipping insertion in model container [2025-03-08 15:09:59,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:09:59,408 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_amount100_file-68.i[916,929] [2025-03-08 15:09:59,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:09:59,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:09:59,508 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_amount100_file-68.i[916,929] [2025-03-08 15:09:59,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:09:59,548 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:09:59,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59 WrapperNode [2025-03-08 15:09:59,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:09:59,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:09:59,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:09:59,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:09:59,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,593 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 387 [2025-03-08 15:09:59,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:09:59,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:09:59,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:09:59,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:09:59,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,636 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-08 15:09:59,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:09:59,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:09:59,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:09:59,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:09:59,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (1/1) ... [2025-03-08 15:09:59,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:09:59,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:09:59,701 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-08 15:09:59,703 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-08 15:09:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:09:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:09:59,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:09:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:09:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:09:59,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:09:59,797 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:09:59,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:10:00,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-03-08 15:10:00,392 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-08 15:10:00,392 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:10:00,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:10:00,420 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:10:00,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:10:00 BoogieIcfgContainer [2025-03-08 15:10:00,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:10:00,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:10:00,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:10:00,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:10:00,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:09:59" (1/3) ... [2025-03-08 15:10:00,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2896d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:10:00, skipping insertion in model container [2025-03-08 15:10:00,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:09:59" (2/3) ... [2025-03-08 15:10:00,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2896d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:10:00, skipping insertion in model container [2025-03-08 15:10:00,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:10:00" (3/3) ... [2025-03-08 15:10:00,430 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-68.i [2025-03-08 15:10:00,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:10:00,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-68.i that has 2 procedures, 161 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:10:00,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:10:00,515 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;@afe6fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:10:00,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:10:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 119 states have internal predecessors, (172), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 15:10:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 15:10:00,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:00,539 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:00,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:00,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1628722732, now seen corresponding path program 1 times [2025-03-08 15:10:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638675783] [2025-03-08 15:10:00,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:00,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 15:10:00,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 15:10:00,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:00,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-08 15:10:00,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:00,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638675783] [2025-03-08 15:10:00,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638675783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:10:00,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688675551] [2025-03-08 15:10:00,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:00,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:00,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:10:00,891 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-08 15:10:00,892 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-08 15:10:00,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 15:10:01,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 15:10:01,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:01,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:01,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:10:01,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:10:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-08 15:10:01,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:10:01,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688675551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:10:01,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:10:01,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:10:01,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445274887] [2025-03-08 15:10:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:10:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:10:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:01,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:10:01,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:10:01,168 INFO L87 Difference]: Start difference. First operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 119 states have internal predecessors, (172), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 15:10:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:01,215 INFO L93 Difference]: Finished difference Result 316 states and 539 transitions. [2025-03-08 15:10:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:10:01,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 268 [2025-03-08 15:10:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:01,221 INFO L225 Difference]: With dead ends: 316 [2025-03-08 15:10:01,222 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 15:10:01,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 269 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-08 15:10:01,226 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:01,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:10:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 15:10:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-08 15:10:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 15:10:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. [2025-03-08 15:10:01,263 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 268 [2025-03-08 15:10:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:01,264 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. [2025-03-08 15:10:01,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 15:10:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2025-03-08 15:10:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 15:10:01,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:01,270 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:01,279 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-08 15:10:01,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:10:01,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:01,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash 725518966, now seen corresponding path program 1 times [2025-03-08 15:10:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828135190] [2025-03-08 15:10:01,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:01,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 15:10:01,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 15:10:01,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:01,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 15:10:01,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:01,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828135190] [2025-03-08 15:10:01,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828135190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:10:01,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:10:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:10:01,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883608814] [2025-03-08 15:10:01,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:10:01,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:10:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:01,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:10:01,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:10:01,878 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:01,940 INFO L93 Difference]: Finished difference Result 313 states and 491 transitions. [2025-03-08 15:10:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:10:01,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-08 15:10:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:01,943 INFO L225 Difference]: With dead ends: 313 [2025-03-08 15:10:01,943 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 15:10:01,944 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-08 15:10:01,947 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:01,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:10:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 15:10:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-08 15:10:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 116 states have internal predecessors, (166), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 15:10:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 246 transitions. [2025-03-08 15:10:01,966 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 246 transitions. Word has length 268 [2025-03-08 15:10:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:01,967 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 246 transitions. [2025-03-08 15:10:01,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 246 transitions. [2025-03-08 15:10:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 15:10:01,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:01,972 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:01,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:10:01,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:01,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:01,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1843967433, now seen corresponding path program 1 times [2025-03-08 15:10:01,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239093295] [2025-03-08 15:10:01,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:01,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 15:10:02,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 15:10:02,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:02,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 15:10:02,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:02,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239093295] [2025-03-08 15:10:02,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239093295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:10:02,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:10:02,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:10:02,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965590130] [2025-03-08 15:10:02,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:10:02,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:10:02,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:02,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:10:02,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:10:02,775 INFO L87 Difference]: Start difference. First operand 158 states and 246 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:03,204 INFO L93 Difference]: Finished difference Result 385 states and 597 transitions. [2025-03-08 15:10:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:10:03,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-08 15:10:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:03,206 INFO L225 Difference]: With dead ends: 385 [2025-03-08 15:10:03,206 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 15:10:03,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:10:03,208 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 431 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:03,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 509 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:10:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 15:10:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2025-03-08 15:10:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 181 states have (on average 1.430939226519337) internal successors, (259), 182 states have internal predecessors, (259), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 345 transitions. [2025-03-08 15:10:03,234 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 345 transitions. Word has length 268 [2025-03-08 15:10:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:03,234 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 345 transitions. [2025-03-08 15:10:03,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 345 transitions. [2025-03-08 15:10:03,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 15:10:03,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:03,238 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:03,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:10:03,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:03,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash -336415624, now seen corresponding path program 1 times [2025-03-08 15:10:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:03,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478185943] [2025-03-08 15:10:03,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:03,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 15:10:03,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 15:10:03,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:03,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 15:10:03,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:03,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478185943] [2025-03-08 15:10:03,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478185943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:10:03,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372255487] [2025-03-08 15:10:03,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:03,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:10:03,572 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-08 15:10:03,573 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-08 15:10:03,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 15:10:03,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 15:10:03,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:03,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 15:10:03,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:10:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1543 proven. 147 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2025-03-08 15:10:04,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:10:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 150 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-03-08 15:10:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372255487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:10:04,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:10:04,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-08 15:10:04,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894159070] [2025-03-08 15:10:04,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:10:04,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:10:04,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:04,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:10:04,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:10:04,813 INFO L87 Difference]: Start difference. First operand 227 states and 345 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-08 15:10:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:05,369 INFO L93 Difference]: Finished difference Result 396 states and 599 transitions. [2025-03-08 15:10:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 15:10:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) Word has length 268 [2025-03-08 15:10:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:05,374 INFO L225 Difference]: With dead ends: 396 [2025-03-08 15:10:05,374 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 15:10:05,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2025-03-08 15:10:05,375 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 666 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:05,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 458 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:10:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 15:10:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-08 15:10:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 15:10:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-08 15:10:05,406 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 268 [2025-03-08 15:10:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:05,406 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-08 15:10:05,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-08 15:10:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-08 15:10:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 15:10:05,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:05,408 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:05,416 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-08 15:10:05,609 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,SelfDestructingSolverStorable3 [2025-03-08 15:10:05,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:05,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1858225309, now seen corresponding path program 1 times [2025-03-08 15:10:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:05,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829927510] [2025-03-08 15:10:05,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:05,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:05,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 15:10:05,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 15:10:05,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:05,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 15:10:06,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829927510] [2025-03-08 15:10:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829927510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:10:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:10:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:10:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697854783] [2025-03-08 15:10:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:10:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:10:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:06,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:10:06,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:10:06,901 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:07,824 INFO L93 Difference]: Finished difference Result 490 states and 698 transitions. [2025-03-08 15:10:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:10:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 270 [2025-03-08 15:10:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:07,827 INFO L225 Difference]: With dead ends: 490 [2025-03-08 15:10:07,828 INFO L226 Difference]: Without dead ends: 323 [2025-03-08 15:10:07,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:10:07,831 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 534 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:07,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 421 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:10:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-08 15:10:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2025-03-08 15:10:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.3691588785046729) internal successors, (293), 215 states have internal predecessors, (293), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 379 transitions. [2025-03-08 15:10:07,858 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 379 transitions. Word has length 270 [2025-03-08 15:10:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:07,860 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 379 transitions. [2025-03-08 15:10:07,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 379 transitions. [2025-03-08 15:10:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 15:10:07,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:07,863 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:07,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:10:07,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:07,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash -350673500, now seen corresponding path program 1 times [2025-03-08 15:10:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:07,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18585306] [2025-03-08 15:10:07,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:07,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 15:10:08,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 15:10:08,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:08,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 15:10:11,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18585306] [2025-03-08 15:10:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18585306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:10:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:10:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:10:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728036374] [2025-03-08 15:10:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:10:11,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:10:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:11,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:10:11,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:10:11,929 INFO L87 Difference]: Start difference. First operand 263 states and 379 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:14,115 INFO L93 Difference]: Finished difference Result 681 states and 967 transitions. [2025-03-08 15:10:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:10:14,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 270 [2025-03-08 15:10:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:14,118 INFO L225 Difference]: With dead ends: 681 [2025-03-08 15:10:14,118 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 15:10:14,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:10:14,122 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 700 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:14,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 861 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 15:10:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 15:10:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 270. [2025-03-08 15:10:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 221 states have (on average 1.3755656108597285) internal successors, (304), 222 states have internal predecessors, (304), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 390 transitions. [2025-03-08 15:10:14,143 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 390 transitions. Word has length 270 [2025-03-08 15:10:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:14,143 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 390 transitions. [2025-03-08 15:10:14,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 390 transitions. [2025-03-08 15:10:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 15:10:14,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:14,148 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:14,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:10:14,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -139322587, now seen corresponding path program 1 times [2025-03-08 15:10:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:14,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361212251] [2025-03-08 15:10:14,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:14,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 15:10:14,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 15:10:14,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:14,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 15:10:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361212251] [2025-03-08 15:10:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361212251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:10:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129265076] [2025-03-08 15:10:14,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:14,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:10:14,594 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-08 15:10:14,596 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-08 15:10:14,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 15:10:14,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 15:10:14,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:14,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:14,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:10:14,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:10:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1327 proven. 33 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2025-03-08 15:10:14,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:10:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 33 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 15:10:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129265076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:10:15,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:10:15,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-08 15:10:15,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508905413] [2025-03-08 15:10:15,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:10:15,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:10:15,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:15,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:10:15,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:10:15,104 INFO L87 Difference]: Start difference. First operand 270 states and 390 transitions. Second operand has 15 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-03-08 15:10:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:16,281 INFO L93 Difference]: Finished difference Result 842 states and 1202 transitions. [2025-03-08 15:10:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 15:10:16,281 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 270 [2025-03-08 15:10:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:16,287 INFO L225 Difference]: With dead ends: 842 [2025-03-08 15:10:16,288 INFO L226 Difference]: Without dead ends: 575 [2025-03-08 15:10:16,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 15:10:16,290 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1250 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:16,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 655 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:10:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-08 15:10:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 296. [2025-03-08 15:10:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 244 states have (on average 1.360655737704918) internal successors, (332), 245 states have internal predecessors, (332), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 418 transitions. [2025-03-08 15:10:16,318 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 418 transitions. Word has length 270 [2025-03-08 15:10:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:16,319 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 418 transitions. [2025-03-08 15:10:16,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-03-08 15:10:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 418 transitions. [2025-03-08 15:10:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 15:10:16,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:16,322 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:16,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:10:16,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:16,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:16,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1769861497, now seen corresponding path program 1 times [2025-03-08 15:10:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:16,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916630680] [2025-03-08 15:10:16,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:16,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 15:10:16,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 15:10:16,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 15:10:16,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:16,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916630680] [2025-03-08 15:10:16,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916630680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:10:16,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890764252] [2025-03-08 15:10:16,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:16,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:10:16,859 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-08 15:10:16,861 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-08 15:10:16,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 15:10:16,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 15:10:16,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:16,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:16,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:10:16,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:10:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 477 proven. 108 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2025-03-08 15:10:17,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:10:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 15:10:17,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890764252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:10:17,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:10:17,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-08 15:10:17,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778842541] [2025-03-08 15:10:17,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:10:17,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:10:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:17,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:10:17,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:10:17,538 INFO L87 Difference]: Start difference. First operand 296 states and 418 transitions. Second operand has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (113), 4 states have call predecessors, (113), 4 states have call successors, (113) [2025-03-08 15:10:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:17,917 INFO L93 Difference]: Finished difference Result 597 states and 843 transitions. [2025-03-08 15:10:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:10:17,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (113), 4 states have call predecessors, (113), 4 states have call successors, (113) Word has length 272 [2025-03-08 15:10:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:17,920 INFO L225 Difference]: With dead ends: 597 [2025-03-08 15:10:17,920 INFO L226 Difference]: Without dead ends: 304 [2025-03-08 15:10:17,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:10:17,921 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 366 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:17,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 781 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:10:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-08 15:10:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2025-03-08 15:10:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 246 states have (on average 1.3577235772357723) internal successors, (334), 247 states have internal predecessors, (334), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 420 transitions. [2025-03-08 15:10:17,949 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 420 transitions. Word has length 272 [2025-03-08 15:10:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:17,950 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 420 transitions. [2025-03-08 15:10:17,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (113), 4 states have call predecessors, (113), 4 states have call successors, (113) [2025-03-08 15:10:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 420 transitions. [2025-03-08 15:10:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 15:10:17,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:17,954 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:17,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:10:18,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:18,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:18,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash 620760774, now seen corresponding path program 1 times [2025-03-08 15:10:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274255268] [2025-03-08 15:10:18,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:18,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 15:10:18,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 15:10:18,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:18,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 15:10:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:18,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274255268] [2025-03-08 15:10:18,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274255268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:10:18,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449969324] [2025-03-08 15:10:18,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:10:18,426 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-08 15:10:18,428 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-08 15:10:18,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 15:10:18,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 15:10:18,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:18,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:18,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:10:18,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:10:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1417 proven. 78 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2025-03-08 15:10:19,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:10:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 15:10:19,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449969324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:10:19,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:10:19,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-08 15:10:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858446232] [2025-03-08 15:10:19,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:10:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:10:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:19,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:10:19,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:10:19,357 INFO L87 Difference]: Start difference. First operand 298 states and 420 transitions. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (120), 3 states have call predecessors, (120), 6 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) [2025-03-08 15:10:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:19,581 INFO L93 Difference]: Finished difference Result 597 states and 841 transitions. [2025-03-08 15:10:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:10:19,585 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (120), 3 states have call predecessors, (120), 6 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) Word has length 272 [2025-03-08 15:10:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:19,586 INFO L225 Difference]: With dead ends: 597 [2025-03-08 15:10:19,586 INFO L226 Difference]: Without dead ends: 302 [2025-03-08 15:10:19,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:10:19,588 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 254 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:19,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 398 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:10:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-08 15:10:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2025-03-08 15:10:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 247 states have internal predecessors, (332), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 418 transitions. [2025-03-08 15:10:19,604 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 418 transitions. Word has length 272 [2025-03-08 15:10:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:19,604 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 418 transitions. [2025-03-08 15:10:19,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (120), 3 states have call predecessors, (120), 6 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) [2025-03-08 15:10:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 418 transitions. [2025-03-08 15:10:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 15:10:19,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:19,606 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:19,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 15:10:19,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:19,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:19,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1646252773, now seen corresponding path program 1 times [2025-03-08 15:10:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:19,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840133687] [2025-03-08 15:10:19,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:19,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:19,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 15:10:19,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 15:10:19,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:19,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 120 proven. 108 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2025-03-08 15:10:20,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:20,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840133687] [2025-03-08 15:10:20,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840133687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:10:20,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738734621] [2025-03-08 15:10:20,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:20,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:10:20,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:10:20,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 15:10:20,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 15:10:20,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 15:10:20,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:20,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:20,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 15:10:20,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:10:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1985 proven. 87 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-03-08 15:10:20,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:10:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-08 15:10:21,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738734621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:10:21,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:10:21,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2025-03-08 15:10:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206540427] [2025-03-08 15:10:21,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:10:21,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 15:10:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:21,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 15:10:21,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:10:21,114 INFO L87 Difference]: Start difference. First operand 298 states and 418 transitions. Second operand has 25 states, 24 states have (on average 7.416666666666667) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (89), 4 states have call predecessors, (89), 9 states have return successors, (91), 9 states have call predecessors, (91), 9 states have call successors, (91) [2025-03-08 15:10:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:23,274 INFO L93 Difference]: Finished difference Result 1334 states and 1832 transitions. [2025-03-08 15:10:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-08 15:10:23,274 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.416666666666667) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (89), 4 states have call predecessors, (89), 9 states have return successors, (91), 9 states have call predecessors, (91), 9 states have call successors, (91) Word has length 272 [2025-03-08 15:10:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:23,278 INFO L225 Difference]: With dead ends: 1334 [2025-03-08 15:10:23,278 INFO L226 Difference]: Without dead ends: 1039 [2025-03-08 15:10:23,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1899, Invalid=5583, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 15:10:23,281 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1914 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:23,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 894 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:10:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-08 15:10:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 420. [2025-03-08 15:10:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 361 states have (on average 1.3268698060941828) internal successors, (479), 362 states have internal predecessors, (479), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 565 transitions. [2025-03-08 15:10:23,312 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 565 transitions. Word has length 272 [2025-03-08 15:10:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:23,312 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 565 transitions. [2025-03-08 15:10:23,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.416666666666667) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (89), 4 states have call predecessors, (89), 9 states have return successors, (91), 9 states have call predecessors, (91), 9 states have call successors, (91) [2025-03-08 15:10:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 565 transitions. [2025-03-08 15:10:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 15:10:23,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:23,313 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:23,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 15:10:23,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:23,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:23,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1381797845, now seen corresponding path program 1 times [2025-03-08 15:10:23,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:23,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733274535] [2025-03-08 15:10:23,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:23,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:23,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 15:10:23,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 15:10:23,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:23,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 15:10:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:23,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733274535] [2025-03-08 15:10:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733274535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:10:23,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:10:23,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:10:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594086795] [2025-03-08 15:10:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:10:23,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:10:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:23,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:10:23,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:10:23,702 INFO L87 Difference]: Start difference. First operand 420 states and 565 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:23,933 INFO L93 Difference]: Finished difference Result 951 states and 1297 transitions. [2025-03-08 15:10:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:10:23,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 275 [2025-03-08 15:10:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:23,936 INFO L225 Difference]: With dead ends: 951 [2025-03-08 15:10:23,936 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 15:10:23,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:10:23,938 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 226 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:23,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 566 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:10:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 15:10:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 428. [2025-03-08 15:10:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 369 states have (on average 1.3197831978319783) internal successors, (487), 370 states have internal predecessors, (487), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 573 transitions. [2025-03-08 15:10:23,966 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 573 transitions. Word has length 275 [2025-03-08 15:10:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:23,966 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 573 transitions. [2025-03-08 15:10:23,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 573 transitions. [2025-03-08 15:10:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 15:10:23,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:23,968 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:23,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:10:23,968 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:23,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -28488148, now seen corresponding path program 1 times [2025-03-08 15:10:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:23,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500559935] [2025-03-08 15:10:23,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 15:10:24,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 15:10:24,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:24,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 15:10:31,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:31,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500559935] [2025-03-08 15:10:31,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500559935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:10:31,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:10:31,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:10:31,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018937175] [2025-03-08 15:10:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:10:31,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:10:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:10:31,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:10:31,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:10:31,361 INFO L87 Difference]: Start difference. First operand 428 states and 573 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:10:33,323 INFO L93 Difference]: Finished difference Result 1371 states and 1841 transitions. [2025-03-08 15:10:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:10:33,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 275 [2025-03-08 15:10:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:10:33,327 INFO L225 Difference]: With dead ends: 1371 [2025-03-08 15:10:33,328 INFO L226 Difference]: Without dead ends: 946 [2025-03-08 15:10:33,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:10:33,330 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 960 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:10:33,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 693 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 15:10:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-08 15:10:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 512. [2025-03-08 15:10:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 453 states have (on average 1.3421633554083885) internal successors, (608), 454 states have internal predecessors, (608), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:10:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 694 transitions. [2025-03-08 15:10:33,377 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 694 transitions. Word has length 275 [2025-03-08 15:10:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:10:33,377 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 694 transitions. [2025-03-08 15:10:33,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 15:10:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 694 transitions. [2025-03-08 15:10:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 15:10:33,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:10:33,378 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:10:33,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:10:33,379 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:10:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:10:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1479063661, now seen corresponding path program 1 times [2025-03-08 15:10:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:10:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258743174] [2025-03-08 15:10:33,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:10:33,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 15:10:33,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 15:10:33,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:33,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 15:10:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:10:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258743174] [2025-03-08 15:10:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258743174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:10:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670829994] [2025-03-08 15:10:34,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:10:34,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:10:34,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:10:34,640 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:10:34,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 15:10:34,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 15:10:34,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 15:10:34,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:10:34,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:10:34,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 15:10:34,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:10:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2262 proven. 297 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 15:10:38,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:11:02,477 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:11:10,193 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 54 DAG size of output: 21 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne)