./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cada0c85d469bf843d2b88bb91f13bf498b21137f0d387bee03f08915f85ad4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:58:26,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:58:26,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:58:26,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:58:26,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:58:26,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:58:26,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:58:26,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:58:26,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:58:26,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:58:26,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:58:26,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:58:26,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:58:26,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:58:26,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:58:26,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:58:26,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:58:26,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:58:26,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:58:26,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:58:26,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:58:26,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:58:26,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:58:26,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:58:26,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:58:26,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:58:26,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:58:26,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:58:26,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:58:26,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:58:26,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:58:26,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:58:26,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:58:26,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:58:26,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:58:26,346 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9cada0c85d469bf843d2b88bb91f13bf498b21137f0d387bee03f08915f85ad4 [2025-03-03 23:58:26,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:58:26,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:58:26,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:58:26,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:58:26,592 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:58:26,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i [2025-03-03 23:58:27,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07467537/67c1c683639a40c394f3621f1890ce6a/FLAG99765f01a [2025-03-03 23:58:27,935 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:58:27,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i [2025-03-03 23:58:27,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07467537/67c1c683639a40c394f3621f1890ce6a/FLAG99765f01a [2025-03-03 23:58:27,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07467537/67c1c683639a40c394f3621f1890ce6a [2025-03-03 23:58:27,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:58:27,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:58:27,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:58:27,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:58:27,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:58:27,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:58:27" (1/1) ... [2025-03-03 23:58:27,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f45945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:27, skipping insertion in model container [2025-03-03 23:58:27,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:58:27" (1/1) ... [2025-03-03 23:58:27,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:58:28,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i[916,929] [2025-03-03 23:58:28,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:58:28,178 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:58:28,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-68.i[916,929] [2025-03-03 23:58:28,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:58:28,245 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:58:28,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28 WrapperNode [2025-03-03 23:58:28,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:58:28,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:58:28,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:58:28,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:58:28,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,291 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 387 [2025-03-03 23:58:28,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:58:28,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:58:28,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:58:28,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:58:28,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,330 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-03 23:58:28,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:58:28,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:58:28,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:58:28,350 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:58:28,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (1/1) ... [2025-03-03 23:58:28,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:58:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:28,376 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-03 23:58:28,378 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-03 23:58:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:58:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:58:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:58:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:58:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:58:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:58:28,456 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:58:28,458 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:58:28,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-03-03 23:58:28,994 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-03 23:58:28,995 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:58:29,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:58:29,017 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:58:29,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:58:29 BoogieIcfgContainer [2025-03-03 23:58:29,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:58:29,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:58:29,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:58:29,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:58:29,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:58:27" (1/3) ... [2025-03-03 23:58:29,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce694c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:58:29, skipping insertion in model container [2025-03-03 23:58:29,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:28" (2/3) ... [2025-03-03 23:58:29,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce694c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:58:29, skipping insertion in model container [2025-03-03 23:58:29,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:58:29" (3/3) ... [2025-03-03 23:58:29,027 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-68.i [2025-03-03 23:58:29,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:58:29,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-68.i that has 2 procedures, 161 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:58:29,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:58:29,099 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;@4cf0a735, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:58:29,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:58:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 119 states have internal predecessors, (172), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 23:58:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 23:58:29,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:29,140 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:29,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:29,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1628722732, now seen corresponding path program 1 times [2025-03-03 23:58:29,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:29,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282049283] [2025-03-03 23:58:29,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:29,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:29,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 23:58:29,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 23:58:29,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:29,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-03 23:58:29,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282049283] [2025-03-03 23:58:29,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282049283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591249017] [2025-03-03 23:58:29,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:29,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:29,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:58:29,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:58:29,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 23:58:29,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 23:58:29,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:29,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:29,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:58:29,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-03 23:58:29,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:58:29,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591249017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:29,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:58:29,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:58:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828169559] [2025-03-03 23:58:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:29,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:58:29,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:29,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:58:29,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:58:29,715 INFO L87 Difference]: Start difference. First operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 119 states have internal predecessors, (172), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 23:58:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:29,762 INFO L93 Difference]: Finished difference Result 316 states and 539 transitions. [2025-03-03 23:58:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:58:29,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 268 [2025-03-03 23:58:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:29,769 INFO L225 Difference]: With dead ends: 316 [2025-03-03 23:58:29,771 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 23:58:29,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:58:29,778 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:29,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:58:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 23:58:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-03 23:58:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 23:58:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. [2025-03-03 23:58:29,824 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 268 [2025-03-03 23:58:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:29,824 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. [2025-03-03 23:58:29,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 23:58:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2025-03-03 23:58:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 23:58:29,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:29,827 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:29,834 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-03 23:58:30,028 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-03 23:58:30,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:30,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 725518966, now seen corresponding path program 1 times [2025-03-03 23:58:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023937742] [2025-03-03 23:58:30,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:30,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 23:58:30,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 23:58:30,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:30,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 23:58:30,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023937742] [2025-03-03 23:58:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023937742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:58:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843738115] [2025-03-03 23:58:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:30,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:58:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:30,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:58:30,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:58:30,373 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:30,429 INFO L93 Difference]: Finished difference Result 313 states and 491 transitions. [2025-03-03 23:58:30,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:58:30,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-03 23:58:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:30,434 INFO L225 Difference]: With dead ends: 313 [2025-03-03 23:58:30,435 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 23:58:30,436 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-03 23:58:30,437 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:30,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:58:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 23:58:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-03 23:58:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 116 states have internal predecessors, (166), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 23:58:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 246 transitions. [2025-03-03 23:58:30,453 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 246 transitions. Word has length 268 [2025-03-03 23:58:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:30,456 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 246 transitions. [2025-03-03 23:58:30,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 246 transitions. [2025-03-03 23:58:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 23:58:30,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:30,460 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:30,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:58:30,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:30,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1843967433, now seen corresponding path program 1 times [2025-03-03 23:58:30,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:30,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51917939] [2025-03-03 23:58:30,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:30,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 23:58:30,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 23:58:30,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:30,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 23:58:31,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:31,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51917939] [2025-03-03 23:58:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51917939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:31,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:58:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207254504] [2025-03-03 23:58:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:58:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:31,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:58:31,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:58:31,381 INFO L87 Difference]: Start difference. First operand 158 states and 246 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:31,777 INFO L93 Difference]: Finished difference Result 385 states and 597 transitions. [2025-03-03 23:58:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:58:31,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-03 23:58:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:31,781 INFO L225 Difference]: With dead ends: 385 [2025-03-03 23:58:31,782 INFO L226 Difference]: Without dead ends: 230 [2025-03-03 23:58:31,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:58:31,784 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 431 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:31,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 509 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:58:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-03 23:58:31,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2025-03-03 23:58:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 181 states have (on average 1.430939226519337) internal successors, (259), 182 states have internal predecessors, (259), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:58:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 345 transitions. [2025-03-03 23:58:31,808 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 345 transitions. Word has length 268 [2025-03-03 23:58:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:31,808 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 345 transitions. [2025-03-03 23:58:31,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 345 transitions. [2025-03-03 23:58:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 23:58:31,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:31,813 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:31,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:58:31,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:31,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash -336415624, now seen corresponding path program 1 times [2025-03-03 23:58:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842272312] [2025-03-03 23:58:31,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:31,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 23:58:31,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 23:58:31,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:31,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 23:58:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842272312] [2025-03-03 23:58:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842272312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518819404] [2025-03-03 23:58:32,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:32,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:32,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:32,196 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-03 23:58:32,198 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-03 23:58:32,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 23:58:32,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 23:58:32,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:32,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:32,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:58:32,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1543 proven. 147 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2025-03-03 23:58:33,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 150 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-03-03 23:58:33,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518819404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:33,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:58:33,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-03 23:58:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819353293] [2025-03-03 23:58:33,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:33,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:58:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:33,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:58:33,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:58:33,489 INFO L87 Difference]: Start difference. First operand 227 states and 345 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-03 23:58:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:34,025 INFO L93 Difference]: Finished difference Result 396 states and 599 transitions. [2025-03-03 23:58:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:58:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) Word has length 268 [2025-03-03 23:58:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:34,029 INFO L225 Difference]: With dead ends: 396 [2025-03-03 23:58:34,029 INFO L226 Difference]: Without dead ends: 172 [2025-03-03 23:58:34,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2025-03-03 23:58:34,030 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 666 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:34,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 458 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:58:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-03 23:58:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-03 23:58:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 23:58:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-03 23:58:34,050 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 268 [2025-03-03 23:58:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:34,050 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-03 23:58:34,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-03 23:58:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-03 23:58:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 23:58:34,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:34,054 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:34,061 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-03 23:58:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 23:58:34,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:34,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1858225309, now seen corresponding path program 1 times [2025-03-03 23:58:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430853032] [2025-03-03 23:58:34,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:34,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 23:58:34,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 23:58:34,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:34,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 23:58:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430853032] [2025-03-03 23:58:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430853032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:35,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:35,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:58:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579860333] [2025-03-03 23:58:35,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:35,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:58:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:35,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:58:35,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:58:35,520 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:36,351 INFO L93 Difference]: Finished difference Result 490 states and 698 transitions. [2025-03-03 23:58:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:58:36,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 270 [2025-03-03 23:58:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:36,355 INFO L225 Difference]: With dead ends: 490 [2025-03-03 23:58:36,355 INFO L226 Difference]: Without dead ends: 323 [2025-03-03 23:58:36,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:58:36,356 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 534 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:36,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 421 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:58:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-03 23:58:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2025-03-03 23:58:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.3691588785046729) internal successors, (293), 215 states have internal predecessors, (293), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:58:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 379 transitions. [2025-03-03 23:58:36,381 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 379 transitions. Word has length 270 [2025-03-03 23:58:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:36,381 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 379 transitions. [2025-03-03 23:58:36,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 379 transitions. [2025-03-03 23:58:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 23:58:36,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:36,383 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:36,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:58:36,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:36,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash -350673500, now seen corresponding path program 1 times [2025-03-03 23:58:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:36,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788654272] [2025-03-03 23:58:36,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:36,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 23:58:36,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 23:58:36,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:36,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 23:58:40,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:40,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788654272] [2025-03-03 23:58:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788654272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:40,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:58:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355766383] [2025-03-03 23:58:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:58:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:40,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:58:40,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:58:40,206 INFO L87 Difference]: Start difference. First operand 263 states and 379 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:42,279 INFO L93 Difference]: Finished difference Result 681 states and 967 transitions. [2025-03-03 23:58:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:58:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 270 [2025-03-03 23:58:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:42,282 INFO L225 Difference]: With dead ends: 681 [2025-03-03 23:58:42,282 INFO L226 Difference]: Without dead ends: 421 [2025-03-03 23:58:42,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:58:42,285 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 700 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:42,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 861 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 23:58:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-03 23:58:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 270. [2025-03-03 23:58:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 221 states have (on average 1.3755656108597285) internal successors, (304), 222 states have internal predecessors, (304), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:58:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 390 transitions. [2025-03-03 23:58:42,305 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 390 transitions. Word has length 270 [2025-03-03 23:58:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:42,305 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 390 transitions. [2025-03-03 23:58:42,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 390 transitions. [2025-03-03 23:58:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 23:58:42,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:42,308 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:42,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:58:42,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:42,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -139322587, now seen corresponding path program 1 times [2025-03-03 23:58:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582087853] [2025-03-03 23:58:42,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 23:58:42,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 23:58:42,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:42,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 23:58:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582087853] [2025-03-03 23:58:42,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582087853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:42,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674827718] [2025-03-03 23:58:42,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:42,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:42,681 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-03 23:58:42,683 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-03 23:58:42,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 23:58:42,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 23:58:42,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:42,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:42,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 23:58:42,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1327 proven. 33 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2025-03-03 23:58:42,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 33 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 23:58:43,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674827718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:43,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:58:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-03 23:58:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658203499] [2025-03-03 23:58:43,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:43,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:58:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:43,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:58:43,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:58:43,165 INFO L87 Difference]: Start difference. First operand 270 states and 390 transitions. Second operand has 15 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-03-03 23:58:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:44,175 INFO L93 Difference]: Finished difference Result 842 states and 1202 transitions. [2025-03-03 23:58:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 23:58:44,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 270 [2025-03-03 23:58:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:44,183 INFO L225 Difference]: With dead ends: 842 [2025-03-03 23:58:44,183 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 23:58:44,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 23:58:44,184 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1250 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:44,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 655 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 23:58:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 23:58:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 296. [2025-03-03 23:58:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 244 states have (on average 1.360655737704918) internal successors, (332), 245 states have internal predecessors, (332), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:58:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 418 transitions. [2025-03-03 23:58:44,221 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 418 transitions. Word has length 270 [2025-03-03 23:58:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:44,222 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 418 transitions. [2025-03-03 23:58:44,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 4 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-03-03 23:58:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 418 transitions. [2025-03-03 23:58:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 23:58:44,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:44,225 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:44,232 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-03 23:58:44,425 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-03 23:58:44,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1769861497, now seen corresponding path program 1 times [2025-03-03 23:58:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635954272] [2025-03-03 23:58:44,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:44,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 23:58:44,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 23:58:44,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:44,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 23:58:44,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:44,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635954272] [2025-03-03 23:58:44,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635954272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:44,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68124690] [2025-03-03 23:58:44,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:44,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:44,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:44,734 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-03 23:58:44,735 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-03 23:58:44,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 23:58:44,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 23:58:44,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:44,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:44,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:58:44,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 477 proven. 108 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2025-03-03 23:58:45,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 23:58:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68124690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:45,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:58:45,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-03 23:58:45,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003022011] [2025-03-03 23:58:45,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:45,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:58:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:45,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:58:45,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:58:45,413 INFO L87 Difference]: Start difference. First operand 296 states and 418 transitions. Second operand has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (113), 4 states have call predecessors, (113), 4 states have call successors, (113) [2025-03-03 23:58:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:45,775 INFO L93 Difference]: Finished difference Result 597 states and 843 transitions. [2025-03-03 23:58:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:58:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (113), 4 states have call predecessors, (113), 4 states have call successors, (113) Word has length 272 [2025-03-03 23:58:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:45,778 INFO L225 Difference]: With dead ends: 597 [2025-03-03 23:58:45,778 INFO L226 Difference]: Without dead ends: 304 [2025-03-03 23:58:45,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:58:45,779 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 366 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:45,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 781 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:58:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-03 23:58:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2025-03-03 23:58:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 246 states have (on average 1.3577235772357723) internal successors, (334), 247 states have internal predecessors, (334), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:58:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 420 transitions. [2025-03-03 23:58:45,803 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 420 transitions. Word has length 272 [2025-03-03 23:58:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:45,804 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 420 transitions. [2025-03-03 23:58:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (113), 4 states have call predecessors, (113), 4 states have call successors, (113) [2025-03-03 23:58:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 420 transitions. [2025-03-03 23:58:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 23:58:45,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:45,806 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:45,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 23:58:46,007 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-03 23:58:46,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:46,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash 620760774, now seen corresponding path program 1 times [2025-03-03 23:58:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834021579] [2025-03-03 23:58:46,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:46,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 23:58:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 23:58:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 23:58:46,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:46,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834021579] [2025-03-03 23:58:46,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834021579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:46,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393409202] [2025-03-03 23:58:46,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:46,307 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-03 23:58:46,309 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-03 23:58:46,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 23:58:46,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 23:58:46,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:46,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:46,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:58:46,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1417 proven. 78 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2025-03-03 23:58:46,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 23:58:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393409202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:47,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:58:47,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-03 23:58:47,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181828082] [2025-03-03 23:58:47,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:47,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 23:58:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:47,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 23:58:47,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:58:47,183 INFO L87 Difference]: Start difference. First operand 298 states and 420 transitions. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (120), 3 states have call predecessors, (120), 6 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) [2025-03-03 23:58:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:47,427 INFO L93 Difference]: Finished difference Result 597 states and 841 transitions. [2025-03-03 23:58:47,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:58:47,428 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (120), 3 states have call predecessors, (120), 6 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) Word has length 272 [2025-03-03 23:58:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:47,430 INFO L225 Difference]: With dead ends: 597 [2025-03-03 23:58:47,430 INFO L226 Difference]: Without dead ends: 302 [2025-03-03 23:58:47,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:58:47,431 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 254 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:47,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 398 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:58:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-03 23:58:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2025-03-03 23:58:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 247 states have internal predecessors, (332), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:58:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 418 transitions. [2025-03-03 23:58:47,448 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 418 transitions. Word has length 272 [2025-03-03 23:58:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:47,448 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 418 transitions. [2025-03-03 23:58:47,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (120), 3 states have call predecessors, (120), 6 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) [2025-03-03 23:58:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 418 transitions. [2025-03-03 23:58:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 23:58:47,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:47,450 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:47,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 23:58:47,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:47,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:47,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1646252773, now seen corresponding path program 1 times [2025-03-03 23:58:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:47,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061970576] [2025-03-03 23:58:47,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:47,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:47,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 23:58:47,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 23:58:47,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:47,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 120 proven. 108 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2025-03-03 23:58:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061970576] [2025-03-03 23:58:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061970576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093552219] [2025-03-03 23:58:47,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:47,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:47,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:47,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:58:48,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 23:58:48,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 23:58:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 23:58:48,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:48,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:48,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 23:58:48,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1985 proven. 87 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-03-03 23:58:48,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-03 23:58:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093552219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:48,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:58:48,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2025-03-03 23:58:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173033413] [2025-03-03 23:58:48,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:48,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 23:58:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:48,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 23:58:48,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-03-03 23:58:48,915 INFO L87 Difference]: Start difference. First operand 298 states and 418 transitions. Second operand has 25 states, 24 states have (on average 7.416666666666667) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (89), 4 states have call predecessors, (89), 9 states have return successors, (91), 9 states have call predecessors, (91), 9 states have call successors, (91) [2025-03-03 23:58:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:51,077 INFO L93 Difference]: Finished difference Result 1334 states and 1832 transitions. [2025-03-03 23:58:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-03 23:58:51,077 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.416666666666667) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (89), 4 states have call predecessors, (89), 9 states have return successors, (91), 9 states have call predecessors, (91), 9 states have call successors, (91) Word has length 272 [2025-03-03 23:58:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:51,083 INFO L225 Difference]: With dead ends: 1334 [2025-03-03 23:58:51,083 INFO L226 Difference]: Without dead ends: 1039 [2025-03-03 23:58:51,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1899, Invalid=5583, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 23:58:51,085 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1914 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:51,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 894 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 23:58:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-03 23:58:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 420. [2025-03-03 23:58:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 361 states have (on average 1.3268698060941828) internal successors, (479), 362 states have internal predecessors, (479), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:58:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 565 transitions. [2025-03-03 23:58:51,120 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 565 transitions. Word has length 272 [2025-03-03 23:58:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:51,120 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 565 transitions. [2025-03-03 23:58:51,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.416666666666667) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (89), 4 states have call predecessors, (89), 9 states have return successors, (91), 9 states have call predecessors, (91), 9 states have call successors, (91) [2025-03-03 23:58:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 565 transitions. [2025-03-03 23:58:51,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 23:58:51,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:51,122 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:51,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 23:58:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:51,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1381797845, now seen corresponding path program 1 times [2025-03-03 23:58:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153937411] [2025-03-03 23:58:51,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:51,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 23:58:51,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 23:58:51,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 23:58:51,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153937411] [2025-03-03 23:58:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153937411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:51,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:51,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:58:51,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929674015] [2025-03-03 23:58:51,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:58:51,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:51,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:58:51,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:58:51,516 INFO L87 Difference]: Start difference. First operand 420 states and 565 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:51,739 INFO L93 Difference]: Finished difference Result 951 states and 1297 transitions. [2025-03-03 23:58:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:58:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 275 [2025-03-03 23:58:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:51,741 INFO L225 Difference]: With dead ends: 951 [2025-03-03 23:58:51,741 INFO L226 Difference]: Without dead ends: 534 [2025-03-03 23:58:51,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:58:51,744 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 226 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:51,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 566 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:58:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-03 23:58:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 428. [2025-03-03 23:58:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 369 states have (on average 1.3197831978319783) internal successors, (487), 370 states have internal predecessors, (487), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:58:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 573 transitions. [2025-03-03 23:58:51,772 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 573 transitions. Word has length 275 [2025-03-03 23:58:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:51,772 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 573 transitions. [2025-03-03 23:58:51,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:58:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 573 transitions. [2025-03-03 23:58:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 23:58:51,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:51,775 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:51,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 23:58:51,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:51,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash -28488148, now seen corresponding path program 1 times [2025-03-03 23:58:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:51,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949885682] [2025-03-03 23:58:51,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:51,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 23:58:51,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 23:58:51,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:51,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 23:58:59,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:59,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949885682] [2025-03-03 23:58:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949885682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:59,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:59,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:58:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700365193] [2025-03-03 23:58:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:59,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:58:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:59,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:58:59,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:58:59,284 INFO L87 Difference]: Start difference. First operand 428 states and 573 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:59:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:59:01,179 INFO L93 Difference]: Finished difference Result 1371 states and 1841 transitions. [2025-03-03 23:59:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:59:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 275 [2025-03-03 23:59:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:59:01,182 INFO L225 Difference]: With dead ends: 1371 [2025-03-03 23:59:01,182 INFO L226 Difference]: Without dead ends: 946 [2025-03-03 23:59:01,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:59:01,183 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 960 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:59:01,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 693 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 23:59:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-03 23:59:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 512. [2025-03-03 23:59:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 453 states have (on average 1.3421633554083885) internal successors, (608), 454 states have internal predecessors, (608), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 23:59:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 694 transitions. [2025-03-03 23:59:01,271 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 694 transitions. Word has length 275 [2025-03-03 23:59:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:59:01,272 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 694 transitions. [2025-03-03 23:59:01,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 23:59:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 694 transitions. [2025-03-03 23:59:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 23:59:01,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:59:01,275 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:59:01,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 23:59:01,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:59:01,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:59:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1479063661, now seen corresponding path program 1 times [2025-03-03 23:59:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:59:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474421967] [2025-03-03 23:59:01,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:59:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:59:01,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 23:59:01,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 23:59:01,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:59:01,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:59:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-03 23:59:02,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:59:02,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474421967] [2025-03-03 23:59:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474421967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:59:02,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238364885] [2025-03-03 23:59:02,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:59:02,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:59:02,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:59:02,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:59:02,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 23:59:02,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 23:59:02,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 23:59:02,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:59:02,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:59:02,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 23:59:02,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:59:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2262 proven. 297 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 23:59:06,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:59:51,720 WARN L286 SmtUtils]: Spent 9.48s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)