./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-90.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 01664cc77fe0f94aba93d78be3bbb8d6dfcad417fd9d550a500a598597cc5b39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:48:51,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:48:51,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:48:51,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:48:51,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:48:51,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:48:51,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:48:51,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:48:51,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:48:51,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:48:51,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:48:51,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:48:51,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:48:51,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:48:51,263 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:48:51,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:48:51,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:48:51,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:48:51,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:48:51,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:48:51,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:48:51,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:48:51,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:48:51,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:48:51,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:51,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:48:51,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:48:51,266 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 -> 01664cc77fe0f94aba93d78be3bbb8d6dfcad417fd9d550a500a598597cc5b39 [2025-03-08 15:48:51,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:48:51,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:48:51,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:48:51,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:48:51,520 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:48:51,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-90.i [2025-03-08 15:48:52,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8b31ef6/afabcfa3ef344d11bec70c5c6c86efce/FLAGdc32f7afd [2025-03-08 15:48:52,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:48:52,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-90.i [2025-03-08 15:48:53,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8b31ef6/afabcfa3ef344d11bec70c5c6c86efce/FLAGdc32f7afd [2025-03-08 15:48:53,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8b31ef6/afabcfa3ef344d11bec70c5c6c86efce [2025-03-08 15:48:53,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:48:53,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:48:53,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:53,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:48:53,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:48:53,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139dcbe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53, skipping insertion in model container [2025-03-08 15:48:53,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:48:53,181 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_amount500_file-90.i[916,929] [2025-03-08 15:48:53,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:53,347 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:48:53,354 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_amount500_file-90.i[916,929] [2025-03-08 15:48:53,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:53,474 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:48:53,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53 WrapperNode [2025-03-08 15:48:53,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:53,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:53,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:48:53,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:48:53,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,590 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 700 [2025-03-08 15:48:53,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:53,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:48:53,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:48:53,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:48:53,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:48:53,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:48:53,766 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:48:53,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:48:53,767 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:48:53,768 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (1/1) ... [2025-03-08 15:48:53,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:53,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:53,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:48:53,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:48:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:48:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:48:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:48:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:48:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:48:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:48:53,953 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:48:53,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:48:54,916 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L669: havoc property_#t~ite55#1;havoc property_#t~bitwise54#1;havoc property_#t~short56#1;havoc property_#t~ite59#1;havoc property_#t~ite58#1;havoc property_#t~bitwise57#1;havoc property_#t~short60#1; [2025-03-08 15:48:55,034 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-08 15:48:55,035 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:48:55,059 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:48:55,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:48:55,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:55 BoogieIcfgContainer [2025-03-08 15:48:55,063 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:48:55,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:48:55,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:48:55,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:48:55,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:48:53" (1/3) ... [2025-03-08 15:48:55,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeea45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:55, skipping insertion in model container [2025-03-08 15:48:55,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:53" (2/3) ... [2025-03-08 15:48:55,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeea45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:55, skipping insertion in model container [2025-03-08 15:48:55,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:55" (3/3) ... [2025-03-08 15:48:55,072 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-90.i [2025-03-08 15:48:55,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:48:55,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-90.i that has 2 procedures, 288 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:48:55,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:48:55,157 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;@78475d2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:48:55,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:48:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 199 states have (on average 1.5326633165829147) internal successors, (305), 200 states have internal predecessors, (305), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:48:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-08 15:48:55,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:55,194 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:55,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:55,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1848074300, now seen corresponding path program 1 times [2025-03-08 15:48:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:55,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098746325] [2025-03-08 15:48:55,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:55,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-08 15:48:55,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-08 15:48:55,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:55,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-08 15:48:55,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:55,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098746325] [2025-03-08 15:48:55,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098746325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062354646] [2025-03-08 15:48:55,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:55,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:55,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:55,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:48:56,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-08 15:48:56,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-08 15:48:56,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:56,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:56,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:48:56,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-08 15:48:56,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:48:56,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062354646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:56,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:48:56,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:48:56,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438609409] [2025-03-08 15:48:56,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:56,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:48:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:56,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:48:56,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:56,364 INFO L87 Difference]: Start difference. First operand has 288 states, 199 states have (on average 1.5326633165829147) internal successors, (305), 200 states have internal predecessors, (305), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 70.0) internal successors, (140), 2 states have internal predecessors, (140), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:48:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:56,433 INFO L93 Difference]: Finished difference Result 570 states and 1035 transitions. [2025-03-08 15:48:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:48:56,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 70.0) internal successors, (140), 2 states have internal predecessors, (140), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 565 [2025-03-08 15:48:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:56,445 INFO L225 Difference]: With dead ends: 570 [2025-03-08 15:48:56,445 INFO L226 Difference]: Without dead ends: 285 [2025-03-08 15:48:56,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:56,456 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:56,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:48:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-08 15:48:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-08 15:48:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 197 states have (on average 1.5126903553299493) internal successors, (298), 197 states have internal predecessors, (298), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:48:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 470 transitions. [2025-03-08 15:48:56,543 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 470 transitions. Word has length 565 [2025-03-08 15:48:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:56,545 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 470 transitions. [2025-03-08 15:48:56,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.0) internal successors, (140), 2 states have internal predecessors, (140), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:48:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 470 transitions. [2025-03-08 15:48:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-08 15:48:56,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:56,558 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:56,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:48:56,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:48:56,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:56,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2122655298, now seen corresponding path program 1 times [2025-03-08 15:48:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425520324] [2025-03-08 15:48:56,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:56,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:56,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-08 15:48:56,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-08 15:48:56,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:48:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425520324] [2025-03-08 15:48:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425520324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:57,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398924303] [2025-03-08 15:48:57,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:57,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:57,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:57,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:57,442 INFO L87 Difference]: Start difference. First operand 285 states and 470 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:48:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:57,598 INFO L93 Difference]: Finished difference Result 848 states and 1402 transitions. [2025-03-08 15:48:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 565 [2025-03-08 15:48:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:57,607 INFO L225 Difference]: With dead ends: 848 [2025-03-08 15:48:57,609 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 15:48:57,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:57,612 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 438 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:57,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 887 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 15:48:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2025-03-08 15:48:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 389 states have (on average 1.4987146529562982) internal successors, (583), 389 states have internal predecessors, (583), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-08 15:48:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 927 transitions. [2025-03-08 15:48:57,701 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 927 transitions. Word has length 565 [2025-03-08 15:48:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:57,702 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 927 transitions. [2025-03-08 15:48:57,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:48:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 927 transitions. [2025-03-08 15:48:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-08 15:48:57,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:57,712 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:57,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:48:57,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:57,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash 17500386, now seen corresponding path program 1 times [2025-03-08 15:48:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359155332] [2025-03-08 15:48:57,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:57,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-08 15:48:57,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-08 15:48:57,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:57,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:48:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359155332] [2025-03-08 15:48:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359155332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:59,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:59,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:48:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116423999] [2025-03-08 15:48:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:59,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:48:59,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:59,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:48:59,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:48:59,296 INFO L87 Difference]: Start difference. First operand 564 states and 927 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:48:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:59,851 INFO L93 Difference]: Finished difference Result 1675 states and 2735 transitions. [2025-03-08 15:48:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:48:59,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 565 [2025-03-08 15:48:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:59,863 INFO L225 Difference]: With dead ends: 1675 [2025-03-08 15:48:59,863 INFO L226 Difference]: Without dead ends: 1114 [2025-03-08 15:48:59,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:48:59,866 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 750 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:59,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1958 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:48:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-03-08 15:48:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 908. [2025-03-08 15:48:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 711 states have (on average 1.5541490857946554) internal successors, (1105), 713 states have internal predecessors, (1105), 192 states have call successors, (192), 4 states have call predecessors, (192), 4 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-08 15:48:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1489 transitions. [2025-03-08 15:48:59,958 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1489 transitions. Word has length 565 [2025-03-08 15:48:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:59,961 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1489 transitions. [2025-03-08 15:48:59,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:48:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1489 transitions. [2025-03-08 15:48:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-08 15:48:59,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:59,973 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:59,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:48:59,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:59,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:59,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1650304385, now seen corresponding path program 1 times [2025-03-08 15:48:59,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:59,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801078284] [2025-03-08 15:48:59,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:59,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:00,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-08 15:49:00,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-08 15:49:00,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:00,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:49:00,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:00,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801078284] [2025-03-08 15:49:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801078284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:00,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:49:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8185488] [2025-03-08 15:49:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:00,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:49:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:00,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:49:00,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:00,730 INFO L87 Difference]: Start difference. First operand 908 states and 1489 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:49:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:00,828 INFO L93 Difference]: Finished difference Result 2238 states and 3667 transitions. [2025-03-08 15:49:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:49:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 565 [2025-03-08 15:49:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:00,838 INFO L225 Difference]: With dead ends: 2238 [2025-03-08 15:49:00,838 INFO L226 Difference]: Without dead ends: 1333 [2025-03-08 15:49:00,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:00,842 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 446 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:00,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1180 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:49:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-03-08 15:49:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 933. [2025-03-08 15:49:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 736 states have (on average 1.5584239130434783) internal successors, (1147), 738 states have internal predecessors, (1147), 192 states have call successors, (192), 4 states have call predecessors, (192), 4 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-08 15:49:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1531 transitions. [2025-03-08 15:49:00,919 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1531 transitions. Word has length 565 [2025-03-08 15:49:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:00,920 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1531 transitions. [2025-03-08 15:49:00,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:49:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1531 transitions. [2025-03-08 15:49:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-08 15:49:00,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:00,925 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:00,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:49:00,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:00,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:00,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1913118719, now seen corresponding path program 1 times [2025-03-08 15:49:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:00,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682823165] [2025-03-08 15:49:00,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:00,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-08 15:49:01,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-08 15:49:01,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:01,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:49:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682823165] [2025-03-08 15:49:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682823165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:02,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:02,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:49:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831935238] [2025-03-08 15:49:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:49:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:02,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:49:02,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:02,465 INFO L87 Difference]: Start difference. First operand 933 states and 1531 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:49:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:02,903 INFO L93 Difference]: Finished difference Result 2591 states and 4267 transitions. [2025-03-08 15:49:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:49:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 565 [2025-03-08 15:49:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:02,914 INFO L225 Difference]: With dead ends: 2591 [2025-03-08 15:49:02,915 INFO L226 Difference]: Without dead ends: 1661 [2025-03-08 15:49:02,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:49:02,919 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 418 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:02,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1374 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:49:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-03-08 15:49:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1082. [2025-03-08 15:49:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 798 states have (on average 1.5225563909774436) internal successors, (1215), 800 states have internal predecessors, (1215), 278 states have call successors, (278), 5 states have call predecessors, (278), 5 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-08 15:49:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1771 transitions. [2025-03-08 15:49:03,032 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1771 transitions. Word has length 565 [2025-03-08 15:49:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:03,034 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1771 transitions. [2025-03-08 15:49:03,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:49:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1771 transitions. [2025-03-08 15:49:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-08 15:49:03,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:03,040 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:03,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:49:03,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:03,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash -811393371, now seen corresponding path program 1 times [2025-03-08 15:49:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127007135] [2025-03-08 15:49:03,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:03,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 15:49:05,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 15:49:05,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:05,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 210 proven. 45 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 15:49:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127007135] [2025-03-08 15:49:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127007135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:49:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684226677] [2025-03-08 15:49:05,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:05,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:05,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:49:05,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:49:05,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:49:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 15:49:06,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 15:49:06,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:06,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:06,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:49:06,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:49:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 3973 proven. 39 refuted. 0 times theorem prover too weak. 10608 trivial. 0 not checked. [2025-03-08 15:49:06,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:49:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 216 proven. 39 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 15:49:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684226677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:49:06,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:49:06,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:49:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392445151] [2025-03-08 15:49:06,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:49:06,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:49:06,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:06,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:49:06,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:49:06,611 INFO L87 Difference]: Start difference. First operand 1082 states and 1771 transitions. Second operand has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 3 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) [2025-03-08 15:49:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:07,300 INFO L93 Difference]: Finished difference Result 2054 states and 3335 transitions. [2025-03-08 15:49:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:49:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 3 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) Word has length 566 [2025-03-08 15:49:07,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:07,309 INFO L225 Difference]: With dead ends: 2054 [2025-03-08 15:49:07,309 INFO L226 Difference]: Without dead ends: 1124 [2025-03-08 15:49:07,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1146 GetRequests, 1129 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:49:07,313 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 539 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:07,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 921 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:49:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-03-08 15:49:07,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1106. [2025-03-08 15:49:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 816 states have (on average 1.4791666666666667) internal successors, (1207), 818 states have internal predecessors, (1207), 278 states have call successors, (278), 11 states have call predecessors, (278), 11 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-08 15:49:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1763 transitions. [2025-03-08 15:49:07,398 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1763 transitions. Word has length 566 [2025-03-08 15:49:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:07,399 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1763 transitions. [2025-03-08 15:49:07,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 3 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) [2025-03-08 15:49:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1763 transitions. [2025-03-08 15:49:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-08 15:49:07,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:07,403 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:07,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:49:07,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 15:49:07,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:07,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 627949127, now seen corresponding path program 1 times [2025-03-08 15:49:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536484565] [2025-03-08 15:49:07,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:07,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 15:49:09,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 15:49:09,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:09,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 204 proven. 51 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 15:49:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:09,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536484565] [2025-03-08 15:49:09,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536484565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:49:09,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510743272] [2025-03-08 15:49:09,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:09,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:09,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:49:09,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:49:09,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:49:10,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 15:49:10,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 15:49:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:10,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:49:10,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:49:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 4845 proven. 51 refuted. 0 times theorem prover too weak. 9724 trivial. 0 not checked. [2025-03-08 15:49:10,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:49:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 204 proven. 51 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 15:49:11,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510743272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:49:11,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:49:11,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 15:49:11,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15683438] [2025-03-08 15:49:11,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:49:11,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:49:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:11,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:49:11,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:49:11,024 INFO L87 Difference]: Start difference. First operand 1106 states and 1763 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-03-08 15:49:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:12,588 INFO L93 Difference]: Finished difference Result 3289 states and 5198 transitions. [2025-03-08 15:49:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 15:49:12,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 566 [2025-03-08 15:49:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:12,604 INFO L225 Difference]: With dead ends: 3289 [2025-03-08 15:49:12,604 INFO L226 Difference]: Without dead ends: 2343 [2025-03-08 15:49:12,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1154 GetRequests, 1130 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-03-08 15:49:12,609 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1814 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1883 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:12,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1883 Valid, 1644 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:49:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2025-03-08 15:49:12,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1376. [2025-03-08 15:49:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1003 states have (on average 1.4636091724825524) internal successors, (1468), 1007 states have internal predecessors, (1468), 355 states have call successors, (355), 17 states have call predecessors, (355), 17 states have return successors, (355), 351 states have call predecessors, (355), 355 states have call successors, (355) [2025-03-08 15:49:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2178 transitions. [2025-03-08 15:49:12,744 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2178 transitions. Word has length 566 [2025-03-08 15:49:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:12,744 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2178 transitions. [2025-03-08 15:49:12,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-03-08 15:49:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2178 transitions. [2025-03-08 15:49:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-08 15:49:12,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:12,750 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:12,760 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-08 15:49:12,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:12,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:12,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1589563144, now seen corresponding path program 1 times [2025-03-08 15:49:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883989618] [2025-03-08 15:49:12,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:12,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 15:49:13,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 15:49:13,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 303 proven. 201 refuted. 0 times theorem prover too weak. 14116 trivial. 0 not checked. [2025-03-08 15:49:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883989618] [2025-03-08 15:49:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883989618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:49:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016640397] [2025-03-08 15:49:14,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:14,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:14,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:49:14,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:49:14,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:49:14,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 15:49:14,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 15:49:14,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:14,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:14,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 15:49:14,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:49:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 9469 proven. 333 refuted. 0 times theorem prover too weak. 4818 trivial. 0 not checked. [2025-03-08 15:49:16,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:49:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 303 proven. 204 refuted. 0 times theorem prover too weak. 14113 trivial. 0 not checked. [2025-03-08 15:49:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016640397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:49:16,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:49:16,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 21 [2025-03-08 15:49:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629715407] [2025-03-08 15:49:16,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:49:16,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 15:49:16,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:16,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 15:49:16,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:49:16,740 INFO L87 Difference]: Start difference. First operand 1376 states and 2178 transitions. Second operand has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 7 states have call successors, (180), 4 states have call predecessors, (180), 8 states have return successors, (181), 7 states have call predecessors, (181), 7 states have call successors, (181) [2025-03-08 15:49:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:17,649 INFO L93 Difference]: Finished difference Result 3230 states and 5114 transitions. [2025-03-08 15:49:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 15:49:17,650 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 7 states have call successors, (180), 4 states have call predecessors, (180), 8 states have return successors, (181), 7 states have call predecessors, (181), 7 states have call successors, (181) Word has length 566 [2025-03-08 15:49:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:17,660 INFO L225 Difference]: With dead ends: 3230 [2025-03-08 15:49:17,660 INFO L226 Difference]: Without dead ends: 2022 [2025-03-08 15:49:17,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 1120 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:49:17,665 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 1596 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:17,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 1690 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:49:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-03-08 15:49:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1424. [2025-03-08 15:49:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1039 states have (on average 1.4456207892204043) internal successors, (1502), 1043 states have internal predecessors, (1502), 355 states have call successors, (355), 29 states have call predecessors, (355), 29 states have return successors, (355), 351 states have call predecessors, (355), 355 states have call successors, (355) [2025-03-08 15:49:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2212 transitions. [2025-03-08 15:49:17,791 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2212 transitions. Word has length 566 [2025-03-08 15:49:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 2212 transitions. [2025-03-08 15:49:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 7 states have call successors, (180), 4 states have call predecessors, (180), 8 states have return successors, (181), 7 states have call predecessors, (181), 7 states have call successors, (181) [2025-03-08 15:49:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2212 transitions. [2025-03-08 15:49:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-08 15:49:17,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:17,796 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:17,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:49:17,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:17,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2099688672, now seen corresponding path program 1 times [2025-03-08 15:49:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384416735] [2025-03-08 15:49:17,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-08 15:49:20,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-08 15:49:20,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:20,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:49:20,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517496197] [2025-03-08 15:49:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:20,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:49:20,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:49:20,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:49:20,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:49:20,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-08 15:49:21,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-08 15:49:21,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:21,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:21,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 15:49:21,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:49:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 10684 proven. 459 refuted. 0 times theorem prover too weak. 3477 trivial. 0 not checked. [2025-03-08 15:49:25,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:49:31,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_63 Int)) (or (< 255 v_z_63) (< c_~var_1_67~0 v_z_63) (< v_z_63 (+ (mod (mod v_z_63 (mod c_~var_1_61~0 256)) 4294967296) 1)))) is different from false [2025-03-08 15:49:41,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:41,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384416735] [2025-03-08 15:49:41,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 15:49:41,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517496197] [2025-03-08 15:49:41,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517496197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:49:41,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:49:41,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2025-03-08 15:49:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828114671] [2025-03-08 15:49:41,898 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 15:49:41,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 15:49:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:41,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 15:49:41,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1398, Unknown=1, NotChecked=80, Total=1806 [2025-03-08 15:49:41,900 INFO L87 Difference]: Start difference. First operand 1424 states and 2212 transitions. Second operand has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 33 states have internal predecessors, (179), 9 states have call successors, (86), 9 states have call predecessors, (86), 14 states have return successors, (86), 9 states have call predecessors, (86), 9 states have call successors, (86)