./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-83.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-83.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 af94c72fed5c617f2d62b60a9a463119b111eeac1c576534ea625be0d9ccdbbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:16:07,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:16:07,756 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:07,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:16:07,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:16:07,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:16:07,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:16:07,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:16:07,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:16:07,788 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:16:07,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:16:07,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:16:07,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:16:07,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:16:07,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:16:07,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:16:07,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:16:07,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:16:07,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:16:07,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:16:07,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:16:07,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:16:07,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:16:07,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:16:07,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:16:07,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:16:07,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:16:07,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:16:07,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:16:07,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:16:07,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:16:07,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:16:07,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:16:07,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:16:07,793 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 -> af94c72fed5c617f2d62b60a9a463119b111eeac1c576534ea625be0d9ccdbbc [2025-03-04 00:16:08,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:16:08,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:16:08,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:16:08,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:16:08,102 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:16:08,103 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-83.i [2025-03-04 00:16:09,204 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f0b7d33/afde6cdf4538476181211e4c50d17c44/FLAG18a859cb7 [2025-03-04 00:16:09,440 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:16:09,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-83.i [2025-03-04 00:16:09,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f0b7d33/afde6cdf4538476181211e4c50d17c44/FLAG18a859cb7 [2025-03-04 00:16:09,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f0b7d33/afde6cdf4538476181211e4c50d17c44 [2025-03-04 00:16:09,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:16:09,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:16:09,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:16:09,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:16:09,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:16:09,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:16:09" (1/1) ... [2025-03-04 00:16:09,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b7db3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:09, skipping insertion in model container [2025-03-04 00:16:09,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:16:09" (1/1) ... [2025-03-04 00:16:09,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:16:09,585 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-83.i[916,929] [2025-03-04 00:16:09,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:16:09,692 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:16:09,702 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-83.i[916,929] [2025-03-04 00:16:09,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:16:09,751 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:16:09,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:09 WrapperNode [2025-03-04 00:16:09,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:16:09,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:16:09,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:16:09,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:16:09,757 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:09" (1/1) ... [2025-03-04 00:16:09,771 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:09" (1/1) ... [2025-03-04 00:16:09,823 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2025-03-04 00:16:09,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:16:09,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:16:09,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:16:09,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:16:09,830 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:09" (1/1) ... [2025-03-04 00:16:09,830 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:09" (1/1) ... [2025-03-04 00:16:09,840 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:09" (1/1) ... [2025-03-04 00:16:09,877 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:09,878 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:09" (1/1) ... [2025-03-04 00:16:09,879 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:09" (1/1) ... [2025-03-04 00:16:09,900 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:09" (1/1) ... [2025-03-04 00:16:09,905 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:09" (1/1) ... [2025-03-04 00:16:09,911 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:09" (1/1) ... [2025-03-04 00:16:09,920 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:09" (1/1) ... [2025-03-04 00:16:09,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:16:09,933 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:16:09,933 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:16:09,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:16:09,934 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:09" (1/1) ... [2025-03-04 00:16:09,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:16:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:09,958 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:09,962 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:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:16:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:16:09,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:16:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:16:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:16:09,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:16:10,060 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:16:10,061 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:16:10,747 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~ite43#1;havoc property_#t~ite42#1;havoc property_#t~bitwise40#1;havoc property_#t~bitwise41#1;havoc property_#t~short44#1;havoc property_#t~ite47#1;havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short48#1; [2025-03-04 00:16:10,834 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-04 00:16:10,834 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:16:10,855 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:16:10,855 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:16:10,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:16:10 BoogieIcfgContainer [2025-03-04 00:16:10,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:16:10,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:16:10,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:16:10,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:16:10,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:16:09" (1/3) ... [2025-03-04 00:16:10,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6963034e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:16:10, skipping insertion in model container [2025-03-04 00:16:10,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:09" (2/3) ... [2025-03-04 00:16:10,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6963034e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:16:10, skipping insertion in model container [2025-03-04 00:16:10,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:16:10" (3/3) ... [2025-03-04 00:16:10,863 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-83.i [2025-03-04 00:16:10,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:16:10,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-83.i that has 2 procedures, 188 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:16:10,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:16:10,934 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;@498f2f6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:16:10,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:16:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 130 states have internal predecessors, (191), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 00:16:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 00:16:10,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:10,956 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:10,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2042278283, now seen corresponding path program 1 times [2025-03-04 00:16:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:10,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257463231] [2025-03-04 00:16:10,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:11,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 00:16:11,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 00:16:11,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:16:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257463231] [2025-03-04 00:16:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257463231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:11,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:16:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303306859] [2025-03-04 00:16:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:11,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:16:11,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:11,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:16:11,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:16:11,624 INFO L87 Difference]: Start difference. First operand has 188 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 130 states have internal predecessors, (191), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:16:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:11,776 INFO L93 Difference]: Finished difference Result 526 states and 953 transitions. [2025-03-04 00:16:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:16:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 353 [2025-03-04 00:16:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:11,793 INFO L225 Difference]: With dead ends: 526 [2025-03-04 00:16:11,793 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 00:16:11,799 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:11,802 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 241 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:11,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 552 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:16:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 00:16:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2025-03-04 00:16:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 237 states have (on average 1.4472573839662448) internal successors, (343), 238 states have internal predecessors, (343), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 00:16:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 539 transitions. [2025-03-04 00:16:11,887 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 539 transitions. Word has length 353 [2025-03-04 00:16:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:11,890 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 539 transitions. [2025-03-04 00:16:11,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:16:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 539 transitions. [2025-03-04 00:16:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 00:16:11,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:11,897 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:16:11,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1349176586, now seen corresponding path program 1 times [2025-03-04 00:16:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25830259] [2025-03-04 00:16:11,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:11,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 00:16:11,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 00:16:11,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:11,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:16:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25830259] [2025-03-04 00:16:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25830259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:12,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:12,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:16:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416139796] [2025-03-04 00:16:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:16:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:12,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:16:12,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:16:12,163 INFO L87 Difference]: Start difference. First operand 338 states and 539 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:16:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:12,350 INFO L93 Difference]: Finished difference Result 1000 states and 1595 transitions. [2025-03-04 00:16:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:16:12,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 353 [2025-03-04 00:16:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:12,357 INFO L225 Difference]: With dead ends: 1000 [2025-03-04 00:16:12,357 INFO L226 Difference]: Without dead ends: 665 [2025-03-04 00:16:12,359 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:12,361 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 272 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:12,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 726 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:16:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-04 00:16:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 362. [2025-03-04 00:16:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 261 states have (on average 1.4482758620689655) internal successors, (378), 262 states have internal predecessors, (378), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 00:16:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 574 transitions. [2025-03-04 00:16:12,435 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 574 transitions. Word has length 353 [2025-03-04 00:16:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:12,437 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 574 transitions. [2025-03-04 00:16:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:16:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 574 transitions. [2025-03-04 00:16:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 00:16:12,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:12,443 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:16:12,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 762113783, now seen corresponding path program 1 times [2025-03-04 00:16:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506057914] [2025-03-04 00:16:12,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:12,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 00:16:12,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 00:16:12,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:12,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:16:12,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:12,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506057914] [2025-03-04 00:16:12,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506057914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:12,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:16:12,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704310392] [2025-03-04 00:16:12,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:12,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:16:12,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:12,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:16:12,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:16:12,722 INFO L87 Difference]: Start difference. First operand 362 states and 574 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:16:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:12,832 INFO L93 Difference]: Finished difference Result 1024 states and 1624 transitions. [2025-03-04 00:16:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:16:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 353 [2025-03-04 00:16:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:12,839 INFO L225 Difference]: With dead ends: 1024 [2025-03-04 00:16:12,839 INFO L226 Difference]: Without dead ends: 665 [2025-03-04 00:16:12,840 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:12,842 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 280 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:12,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 633 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:16:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-04 00:16:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 362. [2025-03-04 00:16:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 261 states have (on average 1.4329501915708813) internal successors, (374), 262 states have internal predecessors, (374), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 00:16:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 570 transitions. [2025-03-04 00:16:12,892 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 570 transitions. Word has length 353 [2025-03-04 00:16:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:12,894 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 570 transitions. [2025-03-04 00:16:12,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:16:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 570 transitions. [2025-03-04 00:16:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:16:12,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:12,898 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:16:12,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash 263552450, now seen corresponding path program 1 times [2025-03-04 00:16:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927205836] [2025-03-04 00:16:12,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:12,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:16:13,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:16:13,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:16:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927205836] [2025-03-04 00:16:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927205836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:14,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924677459] [2025-03-04 00:16:14,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:14,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:14,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:14,219 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:14,221 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:14,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:16:14,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:16:14,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:14,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:14,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:16:14,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3222 proven. 246 refuted. 0 times theorem prover too weak. 2692 trivial. 0 not checked. [2025-03-04 00:16:15,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 78 proven. 249 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-04 00:16:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924677459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:16,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:16,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 26 [2025-03-04 00:16:16,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548533248] [2025-03-04 00:16:16,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:16,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 00:16:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:16,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 00:16:16,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-03-04 00:16:16,151 INFO L87 Difference]: Start difference. First operand 362 states and 570 transitions. Second operand has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 5 states have call successors, (162), 3 states have call predecessors, (162), 7 states have return successors, (163), 5 states have call predecessors, (163), 5 states have call successors, (163) [2025-03-04 00:16:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:19,633 INFO L93 Difference]: Finished difference Result 1741 states and 2597 transitions. [2025-03-04 00:16:19,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 00:16:19,634 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 5 states have call successors, (162), 3 states have call predecessors, (162), 7 states have return successors, (163), 5 states have call predecessors, (163), 5 states have call successors, (163) Word has length 354 [2025-03-04 00:16:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:19,641 INFO L225 Difference]: With dead ends: 1741 [2025-03-04 00:16:19,642 INFO L226 Difference]: Without dead ends: 1382 [2025-03-04 00:16:19,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2582 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1772, Invalid=6600, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 00:16:19,647 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1787 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 735 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1791 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 3676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 735 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:19,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1791 Valid, 2123 Invalid, 3676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [735 Valid, 2941 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 00:16:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-03-04 00:16:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 852. [2025-03-04 00:16:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 641 states have (on average 1.3946957878315132) internal successors, (894), 646 states have internal predecessors, (894), 194 states have call successors, (194), 16 states have call predecessors, (194), 16 states have return successors, (194), 189 states have call predecessors, (194), 194 states have call successors, (194) [2025-03-04 00:16:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1282 transitions. [2025-03-04 00:16:19,737 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1282 transitions. Word has length 354 [2025-03-04 00:16:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:19,738 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1282 transitions. [2025-03-04 00:16:19,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 5 states have call successors, (162), 3 states have call predecessors, (162), 7 states have return successors, (163), 5 states have call predecessors, (163), 5 states have call successors, (163) [2025-03-04 00:16:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1282 transitions. [2025-03-04 00:16:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:16:19,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:19,744 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,752 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:19,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:19,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:19,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1430004118, now seen corresponding path program 1 times [2025-03-04 00:16:19,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:19,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868087268] [2025-03-04 00:16:19,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:19,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:16:20,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:16:20,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:20,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 126 proven. 39 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:16:20,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868087268] [2025-03-04 00:16:20,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868087268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059229604] [2025-03-04 00:16:20,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:20,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:20,505 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:20,507 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:20,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:16:20,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:16:20,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:20,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:20,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:16:20,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2323 proven. 39 refuted. 0 times theorem prover too weak. 3798 trivial. 0 not checked. [2025-03-04 00:16:20,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 126 proven. 39 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:16:21,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059229604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:21,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:21,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:16:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204289968] [2025-03-04 00:16:21,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:21,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:16:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:21,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:16:21,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:16:21,011 INFO L87 Difference]: Start difference. First operand 852 states and 1282 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-04 00:16:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:21,488 INFO L93 Difference]: Finished difference Result 1396 states and 2088 transitions. [2025-03-04 00:16:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:16:21,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 355 [2025-03-04 00:16:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:21,494 INFO L225 Difference]: With dead ends: 1396 [2025-03-04 00:16:21,496 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 00:16:21,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 707 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:16:21,498 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 209 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:21,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 758 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:16:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 00:16:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 532. [2025-03-04 00:16:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 371 states have (on average 1.3396226415094339) internal successors, (497), 374 states have internal predecessors, (497), 146 states have call successors, (146), 14 states have call predecessors, (146), 14 states have return successors, (146), 143 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-04 00:16:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 789 transitions. [2025-03-04 00:16:21,541 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 789 transitions. Word has length 355 [2025-03-04 00:16:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:21,541 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 789 transitions. [2025-03-04 00:16:21,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-04 00:16:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 789 transitions. [2025-03-04 00:16:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-04 00:16:21,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:21,544 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:16:21,745 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:21,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:21,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:21,746 INFO L85 PathProgramCache]: Analyzing trace with hash 397178728, now seen corresponding path program 1 times [2025-03-04 00:16:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:21,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962548645] [2025-03-04 00:16:21,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:21,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:21,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:16:21,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:16:21,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:21,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:16:22,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962548645] [2025-03-04 00:16:22,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962548645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:22,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:22,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:16:22,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178765270] [2025-03-04 00:16:22,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:22,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:16:22,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:22,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:16:22,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:16:22,320 INFO L87 Difference]: Start difference. First operand 532 states and 789 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-04 00:16:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:23,121 INFO L93 Difference]: Finished difference Result 2216 states and 3296 transitions. [2025-03-04 00:16:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:16:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 356 [2025-03-04 00:16:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:23,131 INFO L225 Difference]: With dead ends: 2216 [2025-03-04 00:16:23,131 INFO L226 Difference]: Without dead ends: 1773 [2025-03-04 00:16:23,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:16:23,133 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1111 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:23,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1347 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:16:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-03-04 00:16:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1378. [2025-03-04 00:16:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1011 states have (on average 1.3699307616221563) internal successors, (1385), 1019 states have internal predecessors, (1385), 334 states have call successors, (334), 32 states have call predecessors, (334), 32 states have return successors, (334), 326 states have call predecessors, (334), 334 states have call successors, (334) [2025-03-04 00:16:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2053 transitions. [2025-03-04 00:16:23,217 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2053 transitions. Word has length 356 [2025-03-04 00:16:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:23,217 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 2053 transitions. [2025-03-04 00:16:23,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-04 00:16:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2053 transitions. [2025-03-04 00:16:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-04 00:16:23,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:23,222 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:16:23,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:23,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1947488313, now seen corresponding path program 1 times [2025-03-04 00:16:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718999870] [2025-03-04 00:16:23,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:23,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:16:23,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:16:23,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:23,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:16:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:23,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718999870] [2025-03-04 00:16:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718999870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:16:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175687525] [2025-03-04 00:16:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:23,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:16:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:23,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:16:23,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:16:23,575 INFO L87 Difference]: Start difference. First operand 1378 states and 2053 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:16:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:24,001 INFO L93 Difference]: Finished difference Result 3414 states and 5091 transitions. [2025-03-04 00:16:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:16:24,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 356 [2025-03-04 00:16:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:24,013 INFO L225 Difference]: With dead ends: 3414 [2025-03-04 00:16:24,014 INFO L226 Difference]: Without dead ends: 2129 [2025-03-04 00:16:24,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:16:24,017 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 524 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:24,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 813 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:16:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-03-04 00:16:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1368. [2025-03-04 00:16:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 999 states have (on average 1.3653653653653655) internal successors, (1364), 1007 states have internal predecessors, (1364), 334 states have call successors, (334), 34 states have call predecessors, (334), 34 states have return successors, (334), 326 states have call predecessors, (334), 334 states have call successors, (334) [2025-03-04 00:16:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2032 transitions. [2025-03-04 00:16:24,115 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2032 transitions. Word has length 356 [2025-03-04 00:16:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:24,116 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2032 transitions. [2025-03-04 00:16:24,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:16:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2032 transitions. [2025-03-04 00:16:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-04 00:16:24,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:24,119 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:16:24,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:24,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1047520900, now seen corresponding path program 1 times [2025-03-04 00:16:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775005308] [2025-03-04 00:16:24,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:24,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:16:24,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:16:24,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:16:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775005308] [2025-03-04 00:16:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775005308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209246222] [2025-03-04 00:16:25,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:25,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:25,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:25,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:16:25,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:16:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:16:25,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:16:25,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:25,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:25,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:16:25,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2559 proven. 45 refuted. 0 times theorem prover too weak. 3556 trivial. 0 not checked. [2025-03-04 00:16:25,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 279 proven. 48 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-04 00:16:25,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209246222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:25,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:25,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2025-03-04 00:16:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161974288] [2025-03-04 00:16:25,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:25,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 00:16:25,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:25,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 00:16:25,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:16:25,887 INFO L87 Difference]: Start difference. First operand 1368 states and 2032 transitions. Second operand has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 5 states have call successors, (126), 3 states have call predecessors, (126), 7 states have return successors, (127), 5 states have call predecessors, (127), 5 states have call successors, (127) [2025-03-04 00:16:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:26,857 INFO L93 Difference]: Finished difference Result 2703 states and 3990 transitions. [2025-03-04 00:16:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:16:26,858 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 5 states have call successors, (126), 3 states have call predecessors, (126), 7 states have return successors, (127), 5 states have call predecessors, (127), 5 states have call successors, (127) Word has length 356 [2025-03-04 00:16:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:26,866 INFO L225 Difference]: With dead ends: 2703 [2025-03-04 00:16:26,866 INFO L226 Difference]: Without dead ends: 1428 [2025-03-04 00:16:26,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 703 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:16:26,870 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1112 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:26,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1011 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:16:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-04 00:16:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1381. [2025-03-04 00:16:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1010 states have (on average 1.3277227722772278) internal successors, (1341), 1018 states have internal predecessors, (1341), 332 states have call successors, (332), 38 states have call predecessors, (332), 38 states have return successors, (332), 324 states have call predecessors, (332), 332 states have call successors, (332) [2025-03-04 00:16:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2005 transitions. [2025-03-04 00:16:26,977 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2005 transitions. Word has length 356 [2025-03-04 00:16:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:26,978 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2005 transitions. [2025-03-04 00:16:26,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 5 states have call successors, (126), 3 states have call predecessors, (126), 7 states have return successors, (127), 5 states have call predecessors, (127), 5 states have call successors, (127) [2025-03-04 00:16:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2005 transitions. [2025-03-04 00:16:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-04 00:16:26,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:26,981 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:16:27,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:27,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:27,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:27,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1017394902, now seen corresponding path program 1 times [2025-03-04 00:16:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:27,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521127230] [2025-03-04 00:16:27,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:27,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:27,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-04 00:16:27,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-04 00:16:27,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:27,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:16:27,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:27,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521127230] [2025-03-04 00:16:27,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521127230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:27,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174243179] [2025-03-04 00:16:27,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:27,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:27,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:27,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:16:27,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:16:27,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-04 00:16:27,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-04 00:16:27,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:27,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:27,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:16:27,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3563 proven. 192 refuted. 0 times theorem prover too weak. 2405 trivial. 0 not checked. [2025-03-04 00:16:28,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 132 proven. 195 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-04 00:16:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174243179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:28,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-03-04 00:16:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309492008] [2025-03-04 00:16:28,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:28,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:16:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:28,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:16:28,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:16:28,821 INFO L87 Difference]: Start difference. First operand 1381 states and 2005 transitions. Second operand has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 6 states have call successors, (157), 3 states have call predecessors, (157), 7 states have return successors, (159), 6 states have call predecessors, (159), 6 states have call successors, (159) [2025-03-04 00:16:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:29,635 INFO L93 Difference]: Finished difference Result 2960 states and 4216 transitions. [2025-03-04 00:16:29,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 00:16:29,636 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 6 states have call successors, (157), 3 states have call predecessors, (157), 7 states have return successors, (159), 6 states have call predecessors, (159), 6 states have call successors, (159) Word has length 357 [2025-03-04 00:16:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:29,644 INFO L225 Difference]: With dead ends: 2960 [2025-03-04 00:16:29,644 INFO L226 Difference]: Without dead ends: 1669 [2025-03-04 00:16:29,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2025-03-04 00:16:29,649 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 808 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:29,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 951 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:16:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-03-04 00:16:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1366. [2025-03-04 00:16:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1031 states have (on average 1.3191076624636275) internal successors, (1360), 1039 states have internal predecessors, (1360), 278 states have call successors, (278), 56 states have call predecessors, (278), 56 states have return successors, (278), 270 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-04 00:16:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1916 transitions. [2025-03-04 00:16:29,821 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1916 transitions. Word has length 357 [2025-03-04 00:16:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:29,821 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1916 transitions. [2025-03-04 00:16:29,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 6 states have call successors, (157), 3 states have call predecessors, (157), 7 states have return successors, (159), 6 states have call predecessors, (159), 6 states have call successors, (159) [2025-03-04 00:16:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1916 transitions. [2025-03-04 00:16:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-04 00:16:29,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:29,825 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,832 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-04 00:16:30,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:30,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:30,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:30,026 INFO L85 PathProgramCache]: Analyzing trace with hash 615409097, now seen corresponding path program 1 times [2025-03-04 00:16:30,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:30,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759020609] [2025-03-04 00:16:30,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:30,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:30,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-04 00:16:30,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-04 00:16:30,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:30,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 138 proven. 186 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-03-04 00:16:30,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:30,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759020609] [2025-03-04 00:16:30,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759020609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:30,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823281280] [2025-03-04 00:16:30,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:30,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:30,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:30,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:16:30,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:16:30,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-04 00:16:30,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-04 00:16:30,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:30,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:30,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 00:16:30,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3955 proven. 234 refuted. 0 times theorem prover too weak. 1971 trivial. 0 not checked. [2025-03-04 00:16:31,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:32,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823281280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:32,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:16:32,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2025-03-04 00:16:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035936275] [2025-03-04 00:16:32,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:32,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:16:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:32,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:16:32,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:16:32,083 INFO L87 Difference]: Start difference. First operand 1366 states and 1916 transitions. Second operand has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 18 states have internal predecessors, (140), 8 states have call successors, (112), 5 states have call predecessors, (112), 8 states have return successors, (112), 8 states have call predecessors, (112), 8 states have call successors, (112) [2025-03-04 00:16:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:33,103 INFO L93 Difference]: Finished difference Result 2924 states and 4059 transitions. [2025-03-04 00:16:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 00:16:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 18 states have internal predecessors, (140), 8 states have call successors, (112), 5 states have call predecessors, (112), 8 states have return successors, (112), 8 states have call predecessors, (112), 8 states have call successors, (112) Word has length 357 [2025-03-04 00:16:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:33,110 INFO L225 Difference]: With dead ends: 2924 [2025-03-04 00:16:33,111 INFO L226 Difference]: Without dead ends: 1660 [2025-03-04 00:16:33,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=1095, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 00:16:33,114 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 579 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:33,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1932 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:16:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-04 00:16:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1401. [2025-03-04 00:16:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1052 states have (on average 1.3051330798479088) internal successors, (1373), 1060 states have internal predecessors, (1373), 278 states have call successors, (278), 70 states have call predecessors, (278), 70 states have return successors, (278), 270 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-04 00:16:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1929 transitions. [2025-03-04 00:16:33,261 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1929 transitions. Word has length 357 [2025-03-04 00:16:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:33,261 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 1929 transitions. [2025-03-04 00:16:33,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 18 states have internal predecessors, (140), 8 states have call successors, (112), 5 states have call predecessors, (112), 8 states have return successors, (112), 8 states have call predecessors, (112), 8 states have call successors, (112) [2025-03-04 00:16:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1929 transitions. [2025-03-04 00:16:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-04 00:16:33,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:33,264 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:16:33,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 00:16:33,465 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:33,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash 627223687, now seen corresponding path program 1 times [2025-03-04 00:16:33,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:33,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191636187] [2025-03-04 00:16:33,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:33,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-04 00:16:33,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-04 00:16:33,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:33,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 12 proven. 153 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:16:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191636187] [2025-03-04 00:16:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191636187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194998336] [2025-03-04 00:16:33,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:33,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:33,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:33,955 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-04 00:16:33,956 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-04 00:16:34,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-04 00:16:34,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-04 00:16:34,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:34,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:34,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:16:34,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 932 proven. 300 refuted. 0 times theorem prover too weak. 4928 trivial. 0 not checked. [2025-03-04 00:16:34,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 12 proven. 153 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:16:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194998336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:35,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2025-03-04 00:16:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764099232] [2025-03-04 00:16:35,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:35,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:16:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:35,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:16:35,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:16:35,182 INFO L87 Difference]: Start difference. First operand 1401 states and 1929 transitions. Second operand has 14 states, 14 states have (on average 13.642857142857142) internal successors, (191), 14 states have internal predecessors, (191), 4 states have call successors, (158), 3 states have call predecessors, (158), 5 states have return successors, (159), 4 states have call predecessors, (159), 4 states have call successors, (159) [2025-03-04 00:16:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:36,813 INFO L93 Difference]: Finished difference Result 5920 states and 7942 transitions. [2025-03-04 00:16:36,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 00:16:36,813 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.642857142857142) internal successors, (191), 14 states have internal predecessors, (191), 4 states have call successors, (158), 3 states have call predecessors, (158), 5 states have return successors, (159), 4 states have call predecessors, (159), 4 states have call successors, (159) Word has length 358 [2025-03-04 00:16:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:36,827 INFO L225 Difference]: With dead ends: 5920 [2025-03-04 00:16:36,827 INFO L226 Difference]: Without dead ends: 4637 [2025-03-04 00:16:36,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=1015, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 00:16:36,831 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 916 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:36,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1520 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:16:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4637 states. [2025-03-04 00:16:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4637 to 2648. [2025-03-04 00:16:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 1984 states have (on average 1.2661290322580645) internal successors, (2512), 2001 states have internal predecessors, (2512), 508 states have call successors, (508), 155 states have call predecessors, (508), 155 states have return successors, (508), 491 states have call predecessors, (508), 508 states have call successors, (508) [2025-03-04 00:16:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 3528 transitions. [2025-03-04 00:16:37,225 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 3528 transitions. Word has length 358 [2025-03-04 00:16:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:37,226 INFO L471 AbstractCegarLoop]: Abstraction has 2648 states and 3528 transitions. [2025-03-04 00:16:37,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.642857142857142) internal successors, (191), 14 states have internal predecessors, (191), 4 states have call successors, (158), 3 states have call predecessors, (158), 5 states have return successors, (159), 4 states have call predecessors, (159), 4 states have call successors, (159) [2025-03-04 00:16:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 3528 transitions. [2025-03-04 00:16:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-04 00:16:37,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:37,233 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,243 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-04 00:16:37,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:37,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:37,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash 756244406, now seen corresponding path program 1 times [2025-03-04 00:16:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:37,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807159041] [2025-03-04 00:16:37,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:37,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-04 00:16:37,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-04 00:16:37,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:37,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:16:37,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041293464] [2025-03-04 00:16:37,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:37,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:37,745 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-04 00:16:37,747 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-04 00:16:37,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-04 00:16:37,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-04 00:16:37,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:37,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:37,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:16:37,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 800 proven. 453 refuted. 0 times theorem prover too weak. 4907 trivial. 0 not checked. [2025-03-04 00:16:39,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:58,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:58,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807159041] [2025-03-04 00:16:58,172 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:16:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041293464] [2025-03-04 00:16:58,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041293464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:58,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:16:58,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-04 00:16:58,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617902122] [2025-03-04 00:16:58,172 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:58,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:16:58,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:58,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:16:58,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=244, Unknown=4, NotChecked=0, Total=306 [2025-03-04 00:16:58,173 INFO L87 Difference]: Start difference. First operand 2648 states and 3528 transitions. Second operand has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-04 00:17:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:06,383 INFO L93 Difference]: Finished difference Result 5318 states and 7045 transitions. [2025-03-04 00:17:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:17:06,384 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 359 [2025-03-04 00:17:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:06,397 INFO L225 Difference]: With dead ends: 5318 [2025-03-04 00:17:06,398 INFO L226 Difference]: Without dead ends: 2796 [2025-03-04 00:17:06,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=117, Invalid=431, Unknown=4, NotChecked=0, Total=552 [2025-03-04 00:17:06,403 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 573 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:06,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1423 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-04 00:17:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2025-03-04 00:17:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2414. [2025-03-04 00:17:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 1786 states have (on average 1.265397536394177) internal successors, (2260), 1797 states have internal predecessors, (2260), 484 states have call successors, (484), 143 states have call predecessors, (484), 143 states have return successors, (484), 473 states have call predecessors, (484), 484 states have call successors, (484) [2025-03-04 00:17:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3228 transitions. [2025-03-04 00:17:06,660 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3228 transitions. Word has length 359 [2025-03-04 00:17:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:06,660 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3228 transitions. [2025-03-04 00:17:06,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-04 00:17:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3228 transitions. [2025-03-04 00:17:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-04 00:17:06,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:06,663 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:06,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 00:17:06,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:06,864 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:06,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1795285417, now seen corresponding path program 1 times [2025-03-04 00:17:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:06,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988571339] [2025-03-04 00:17:06,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:06,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:06,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-04 00:17:07,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-04 00:17:07,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:07,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:17:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988571339] [2025-03-04 00:17:07,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988571339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:17:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779603506] [2025-03-04 00:17:07,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:07,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:07,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:07,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:17:07,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:17:08,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-04 00:17:08,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-04 00:17:08,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:08,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:08,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:17:08,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:17:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2972 proven. 258 refuted. 0 times theorem prover too weak. 2930 trivial. 0 not checked. [2025-03-04 00:17:21,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:17:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 66 proven. 261 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-04 00:17:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779603506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:17:29,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:17:29,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 12] total 26 [2025-03-04 00:17:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461794012] [2025-03-04 00:17:29,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:17:29,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 00:17:29,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:29,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 00:17:29,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2025-03-04 00:17:29,609 INFO L87 Difference]: Start difference. First operand 2414 states and 3228 transitions. Second operand has 26 states, 26 states have (on average 9.26923076923077) internal successors, (241), 26 states have internal predecessors, (241), 8 states have call successors, (168), 4 states have call predecessors, (168), 8 states have return successors, (168), 5 states have call predecessors, (168), 8 states have call successors, (168)