./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.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 e696ddcc55bba12fd312675629badb4dfe4eee6844d87ecc0509451d1004be73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:16:19,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:16:19,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:16:19,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:16:19,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:16:19,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:16:19,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:16:19,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:16:19,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:16:19,696 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:16:19,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:16:19,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:16:19,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:16:19,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:16:19,697 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:16:19,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:16:19,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:16:19,698 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:16:19,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:16:19,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:16:19,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:16:19,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:16:19,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:16:19,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:16:19,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:16:19,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:16:19,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:16:19,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:16:19,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:16:19,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:16:19,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:16:19,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:16:19,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:16:19,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:16:19,700 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 -> e696ddcc55bba12fd312675629badb4dfe4eee6844d87ecc0509451d1004be73 [2025-03-04 00:16:19,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:16:19,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:16:19,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:16:19,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:16:19,938 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:16:19,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.i [2025-03-04 00:16:21,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10be757dc/c32a553aa3d949daa49c85ad488fe6c2/FLAG8894dd827 [2025-03-04 00:16:21,289 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:16:21,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.i [2025-03-04 00:16:21,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10be757dc/c32a553aa3d949daa49c85ad488fe6c2/FLAG8894dd827 [2025-03-04 00:16:21,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10be757dc/c32a553aa3d949daa49c85ad488fe6c2 [2025-03-04 00:16:21,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:16:21,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:16:21,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:16:21,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:16:21,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:16:21,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:21,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f70ccfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21, skipping insertion in model container [2025-03-04 00:16:21,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:21,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:16:21,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.i[916,929] [2025-03-04 00:16:21,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:16:21,885 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:16:21,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.i[916,929] [2025-03-04 00:16:21,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:16:21,966 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:16:21,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21 WrapperNode [2025-03-04 00:16:21,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:16:21,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:16:21,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:16:21,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:16:21,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:21,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,024 INFO L138 Inliner]: procedures = 26, calls = 81, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 453 [2025-03-04 00:16:22,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:16:22,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:16:22,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:16:22,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:16:22,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,075 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:16:22,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:16:22,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:16:22,125 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:16:22,125 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:16:22,126 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (1/1) ... [2025-03-04 00:16:22,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:16:22,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:22,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:16:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:16:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:16:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:16:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:16:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:16:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:16:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:16:22,269 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:16:22,271 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:16:22,799 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc property_#t~bitwise46#1;havoc property_#t~short47#1;havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short50#1; [2025-03-04 00:16:22,868 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-04 00:16:22,868 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:16:22,890 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:16:22,890 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:16:22,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:16:22 BoogieIcfgContainer [2025-03-04 00:16:22,891 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:16:22,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:16:22,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:16:22,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:16:22,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:16:21" (1/3) ... [2025-03-04 00:16:22,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28425a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:16:22, skipping insertion in model container [2025-03-04 00:16:22,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:21" (2/3) ... [2025-03-04 00:16:22,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28425a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:16:22, skipping insertion in model container [2025-03-04 00:16:22,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:16:22" (3/3) ... [2025-03-04 00:16:22,898 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-86.i [2025-03-04 00:16:22,907 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:16:22,909 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-86.i that has 2 procedures, 195 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:16:22,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:16:22,967 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;@5ef3f347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:16:22,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:16:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 125 states have internal predecessors, (176), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:16:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:16:22,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:22,991 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:16:22,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:22,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1882196192, now seen corresponding path program 1 times [2025-03-04 00:16:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:23,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808699140] [2025-03-04 00:16:23,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:23,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:23,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:16:23,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:16:23,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:23,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-03-04 00:16:23,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:23,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808699140] [2025-03-04 00:16:23,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808699140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898860340] [2025-03-04 00:16:23,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:23,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:23,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:23,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:16:23,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:16:23,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:16:23,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:16:23,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:23,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:23,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:16:23,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-03-04 00:16:23,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:16:23,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898860340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:23,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:16:23,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:16:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107035424] [2025-03-04 00:16:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:23,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:16:23,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:23,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:16:23,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:16:23,805 INFO L87 Difference]: Start difference. First operand has 195 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 125 states have internal predecessors, (176), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:16:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:23,848 INFO L93 Difference]: Finished difference Result 384 states and 687 transitions. [2025-03-04 00:16:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:16:23,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) Word has length 430 [2025-03-04 00:16:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:23,855 INFO L225 Difference]: With dead ends: 384 [2025-03-04 00:16:23,855 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 00:16:23,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:16:23,861 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:23,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:16:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 00:16:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-04 00:16:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 122 states have (on average 1.401639344262295) internal successors, (171), 122 states have internal predecessors, (171), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:16:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 307 transitions. [2025-03-04 00:16:23,920 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 307 transitions. Word has length 430 [2025-03-04 00:16:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:23,920 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 307 transitions. [2025-03-04 00:16:23,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:16:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 307 transitions. [2025-03-04 00:16:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:16:23,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:23,931 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:16:23,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:16:24,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:16:24,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1702115676, now seen corresponding path program 1 times [2025-03-04 00:16:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977229531] [2025-03-04 00:16:24,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:24,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:16:24,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:16:24,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:24,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:16:24,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:24,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977229531] [2025-03-04 00:16:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977229531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:24,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:24,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:16:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058155950] [2025-03-04 00:16:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:24,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:16:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:24,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:16:24,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:16:24,536 INFO L87 Difference]: Start difference. First operand 192 states and 307 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:16:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:24,640 INFO L93 Difference]: Finished difference Result 541 states and 864 transitions. [2025-03-04 00:16:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:16:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 430 [2025-03-04 00:16:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:24,648 INFO L225 Difference]: With dead ends: 541 [2025-03-04 00:16:24,649 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 00:16:24,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:16:24,651 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 240 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:24,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 789 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:16:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 00:16:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 218. [2025-03-04 00:16:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 148 states have internal predecessors, (215), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:16:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 351 transitions. [2025-03-04 00:16:24,709 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 351 transitions. Word has length 430 [2025-03-04 00:16:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:24,711 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 351 transitions. [2025-03-04 00:16:24,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:16:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 351 transitions. [2025-03-04 00:16:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:16:24,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:24,715 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:16:24,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:16:24,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:24,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash 381628771, now seen corresponding path program 1 times [2025-03-04 00:16:24,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:24,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863525911] [2025-03-04 00:16:24,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:24,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:24,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:16:24,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:16:24,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:16:25,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863525911] [2025-03-04 00:16:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863525911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:25,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:25,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:16:25,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002277602] [2025-03-04 00:16:25,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:16:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:25,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:16:25,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:16:25,552 INFO L87 Difference]: Start difference. First operand 218 states and 351 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:16:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:25,733 INFO L93 Difference]: Finished difference Result 500 states and 796 transitions. [2025-03-04 00:16:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:16:25,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 430 [2025-03-04 00:16:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:25,737 INFO L225 Difference]: With dead ends: 500 [2025-03-04 00:16:25,738 INFO L226 Difference]: Without dead ends: 285 [2025-03-04 00:16:25,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:16:25,741 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 281 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:25,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 717 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:16:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-04 00:16:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 236. [2025-03-04 00:16:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 165 states have (on average 1.4606060606060607) internal successors, (241), 165 states have internal predecessors, (241), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:16:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 377 transitions. [2025-03-04 00:16:25,773 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 377 transitions. Word has length 430 [2025-03-04 00:16:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 377 transitions. [2025-03-04 00:16:25,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:16:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 377 transitions. [2025-03-04 00:16:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:16:25,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:25,781 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:16:25,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:16:25,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:25,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1023425059, now seen corresponding path program 1 times [2025-03-04 00:16:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:25,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698133298] [2025-03-04 00:16:25,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:25,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:16:25,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:16:25,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:25,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:16:26,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:26,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698133298] [2025-03-04 00:16:26,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698133298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:26,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:26,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:16:26,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326810207] [2025-03-04 00:16:26,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:26,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:16:26,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:26,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:16:26,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:16:26,807 INFO L87 Difference]: Start difference. First operand 236 states and 377 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:16:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:27,044 INFO L93 Difference]: Finished difference Result 541 states and 861 transitions. [2025-03-04 00:16:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:16:27,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 430 [2025-03-04 00:16:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:27,048 INFO L225 Difference]: With dead ends: 541 [2025-03-04 00:16:27,048 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 00:16:27,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:16:27,050 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 405 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:27,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 716 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:16:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 00:16:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 245. [2025-03-04 00:16:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 174 states have (on average 1.4770114942528736) internal successors, (257), 174 states have internal predecessors, (257), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:16:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 393 transitions. [2025-03-04 00:16:27,075 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 393 transitions. Word has length 430 [2025-03-04 00:16:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:27,076 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 393 transitions. [2025-03-04 00:16:27,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:16:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 393 transitions. [2025-03-04 00:16:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:16:27,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:27,081 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:16:27,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:16:27,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:27,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash 574728420, now seen corresponding path program 1 times [2025-03-04 00:16:27,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:27,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464204008] [2025-03-04 00:16:27,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:27,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:16:27,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:16:27,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:27,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 87 proven. 114 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-04 00:16:27,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464204008] [2025-03-04 00:16:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464204008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56009824] [2025-03-04 00:16:27,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:27,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:27,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:27,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:16:27,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:16:27,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:16:28,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:16:28,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:28,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:28,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:16:28,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 3567 proven. 51 refuted. 0 times theorem prover too weak. 5494 trivial. 0 not checked. [2025-03-04 00:16:28,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 150 proven. 51 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-04 00:16:28,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56009824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:28,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-04 00:16:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383335582] [2025-03-04 00:16:28,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:28,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:16:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:28,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:16:28,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:16:28,764 INFO L87 Difference]: Start difference. First operand 245 states and 393 transitions. Second operand has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 6 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 6 states have call predecessors, (152), 6 states have call successors, (152) [2025-03-04 00:16:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:29,591 INFO L93 Difference]: Finished difference Result 542 states and 862 transitions. [2025-03-04 00:16:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:16:29,593 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 6 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 6 states have call predecessors, (152), 6 states have call successors, (152) Word has length 430 [2025-03-04 00:16:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:29,596 INFO L225 Difference]: With dead ends: 542 [2025-03-04 00:16:29,596 INFO L226 Difference]: Without dead ends: 300 [2025-03-04 00:16:29,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:16:29,599 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 900 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:29,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 902 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:16:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-04 00:16:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2025-03-04 00:16:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 183 states have (on average 1.4316939890710383) internal successors, (262), 183 states have internal predecessors, (262), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:16:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 398 transitions. [2025-03-04 00:16:29,628 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 398 transitions. Word has length 430 [2025-03-04 00:16:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 398 transitions. [2025-03-04 00:16:29,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 6 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 6 states have call predecessors, (152), 6 states have call successors, (152) [2025-03-04 00:16:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 398 transitions. [2025-03-04 00:16:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-04 00:16:29,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:29,639 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:16:29,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:16:29,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:29,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash 379656872, now seen corresponding path program 1 times [2025-03-04 00:16:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150675878] [2025-03-04 00:16:29,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:29,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:16:30,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:16:30,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:30,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat